/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_05-funloop_hard2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 15:08:18,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 15:08:18,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 15:08:18,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 15:08:18,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 15:08:18,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 15:08:18,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 15:08:18,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 15:08:18,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 15:08:18,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 15:08:18,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 15:08:18,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 15:08:18,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 15:08:18,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 15:08:18,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 15:08:18,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 15:08:18,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 15:08:18,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 15:08:18,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 15:08:18,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 15:08:18,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 15:08:18,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 15:08:18,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 15:08:18,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 15:08:18,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 15:08:18,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 15:08:18,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 15:08:18,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 15:08:18,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 15:08:18,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 15:08:18,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 15:08:18,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 15:08:18,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 15:08:18,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 15:08:18,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 15:08:18,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 15:08:18,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 15:08:18,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 15:08:18,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 15:08:18,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 15:08:18,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 15:08:18,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-15 15:08:18,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 15:08:18,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 15:08:18,163 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 15:08:18,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 15:08:18,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 15:08:18,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 15:08:18,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 15:08:18,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 15:08:18,164 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 15:08:18,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 15:08:18,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 15:08:18,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 15:08:18,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 15:08:18,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:08:18,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 15:08:18,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 15:08:18,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 15:08:18,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 15:08:18,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 15:08:18,360 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 15:08:18,362 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 15:08:18,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-03-15 15:08:18,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf89cb50/73d49aa76a8a40e5b7822a7ae0af7ae9/FLAG2882a4982 [2022-03-15 15:08:18,802 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 15:08:18,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-03-15 15:08:18,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf89cb50/73d49aa76a8a40e5b7822a7ae0af7ae9/FLAG2882a4982 [2022-03-15 15:08:18,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf89cb50/73d49aa76a8a40e5b7822a7ae0af7ae9 [2022-03-15 15:08:18,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 15:08:18,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 15:08:18,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 15:08:18,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 15:08:18,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 15:08:18,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b874806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18, skipping insertion in model container [2022-03-15 15:08:18,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 15:08:18,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 15:08:19,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:08:19,189 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 15:08:19,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:08:19,255 INFO L208 MainTranslator]: Completed translation [2022-03-15 15:08:19,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19 WrapperNode [2022-03-15 15:08:19,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 15:08:19,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 15:08:19,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 15:08:19,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 15:08:19,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,314 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-03-15 15:08:19,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 15:08:19,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 15:08:19,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 15:08:19,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 15:08:19,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 15:08:19,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 15:08:19,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 15:08:19,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 15:08:19,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (1/1) ... [2022-03-15 15:08:19,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:08:19,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:19,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 15:08:19,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 15:08:19,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 15:08:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 15:08:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 15:08:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 15:08:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 15:08:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 15:08:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 15:08:19,418 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 15:08:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 15:08:19,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 15:08:19,420 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 15:08:19,521 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 15:08:19,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 15:08:19,724 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 15:08:19,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 15:08:19,729 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 15:08:19,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:08:19 BoogieIcfgContainer [2022-03-15 15:08:19,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 15:08:19,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 15:08:19,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 15:08:19,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 15:08:19,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:08:18" (1/3) ... [2022-03-15 15:08:19,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c26df30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:08:19, skipping insertion in model container [2022-03-15 15:08:19,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:19" (2/3) ... [2022-03-15 15:08:19,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c26df30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:08:19, skipping insertion in model container [2022-03-15 15:08:19,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:08:19" (3/3) ... [2022-03-15 15:08:19,742 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-03-15 15:08:19,748 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 15:08:19,748 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 15:08:19,748 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-15 15:08:19,748 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 15:08:19,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,803 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,804 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,815 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,815 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,818 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 15:08:19,849 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 15:08:19,853 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 15:08:19,854 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-15 15:08:19,862 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 128 transitions, 261 flow [2022-03-15 15:08:19,981 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 15:08:19,994 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:19,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:19,994 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash -88358338, now seen corresponding path program 1 times [2022-03-15 15:08:20,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:20,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557617517] [2022-03-15 15:08:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:20,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:20,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557617517] [2022-03-15 15:08:20,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557617517] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:20,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:20,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:08:20,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240007086] [2022-03-15 15:08:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:20,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 15:08:20,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 15:08:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:08:20,145 INFO L87 Difference]: Start difference. First operand has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:20,192 INFO L93 Difference]: Finished difference Result 2321 states and 4620 transitions. [2022-03-15 15:08:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 15:08:20,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 15:08:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:20,215 INFO L225 Difference]: With dead ends: 2321 [2022-03-15 15:08:20,215 INFO L226 Difference]: Without dead ends: 2321 [2022-03-15 15:08:20,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:08:20,219 INFO L933 BasicCegarLoop]: 123 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, 123 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:20,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2022-03-15 15:08:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2022-03-15 15:08:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2307 states have (on average 2.0026007802340704) internal successors, (4620), 2320 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4620 transitions. [2022-03-15 15:08:20,320 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4620 transitions. Word has length 31 [2022-03-15 15:08:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:20,321 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 4620 transitions. [2022-03-15 15:08:20,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4620 transitions. [2022-03-15 15:08:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 15:08:20,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:20,326 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:20,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 15:08:20,328 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash -932830209, now seen corresponding path program 1 times [2022-03-15 15:08:20,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:20,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053147986] [2022-03-15 15:08:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:20,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:20,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053147986] [2022-03-15 15:08:20,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053147986] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:20,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:20,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 15:08:20,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159384908] [2022-03-15 15:08:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:20,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:08:20,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:20,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:08:20,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:08:20,412 INFO L87 Difference]: Start difference. First operand 2321 states and 4620 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:20,443 INFO L93 Difference]: Finished difference Result 2325 states and 4624 transitions. [2022-03-15 15:08:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:08:20,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 15:08:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:20,452 INFO L225 Difference]: With dead ends: 2325 [2022-03-15 15:08:20,452 INFO L226 Difference]: Without dead ends: 2325 [2022-03-15 15:08:20,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:08:20,454 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:20,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 236 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-03-15 15:08:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2322. [2022-03-15 15:08:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2308 states have (on average 2.002166377816291) internal successors, (4621), 2321 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4621 transitions. [2022-03-15 15:08:20,503 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 4621 transitions. Word has length 31 [2022-03-15 15:08:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:20,504 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 4621 transitions. [2022-03-15 15:08:20,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 4621 transitions. [2022-03-15 15:08:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 15:08:20,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:20,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:20,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 15:08:20,506 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash 527090186, now seen corresponding path program 1 times [2022-03-15 15:08:20,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:20,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378749450] [2022-03-15 15:08:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:20,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:20,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378749450] [2022-03-15 15:08:20,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378749450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:20,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239289135] [2022-03-15 15:08:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:20,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:20,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:20,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:20,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 15:08:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:20,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-15 15:08:20,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 15:08:20,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:20,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239289135] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:20,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:20,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-15 15:08:20,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742499266] [2022-03-15 15:08:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:20,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:08:20,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:20,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:08:20,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:20,762 INFO L87 Difference]: Start difference. First operand 2322 states and 4621 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:20,828 INFO L93 Difference]: Finished difference Result 3432 states and 6841 transitions. [2022-03-15 15:08:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:08:20,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 15:08:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:20,839 INFO L225 Difference]: With dead ends: 3432 [2022-03-15 15:08:20,839 INFO L226 Difference]: Without dead ends: 3432 [2022-03-15 15:08:20,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:20,842 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 66 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:20,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 272 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-03-15 15:08:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2359. [2022-03-15 15:08:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2345 states have (on average 2.002132196162047) internal successors, (4695), 2358 states have internal predecessors, (4695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4695 transitions. [2022-03-15 15:08:20,891 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4695 transitions. Word has length 36 [2022-03-15 15:08:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:20,892 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 4695 transitions. [2022-03-15 15:08:20,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4695 transitions. [2022-03-15 15:08:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 15:08:20,894 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:20,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:20,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:21,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:21,112 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:21,113 INFO L85 PathProgramCache]: Analyzing trace with hash -877434549, now seen corresponding path program 1 times [2022-03-15 15:08:21,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:21,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096540399] [2022-03-15 15:08:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:21,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:21,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:21,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096540399] [2022-03-15 15:08:21,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096540399] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:21,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925653599] [2022-03-15 15:08:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:21,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:21,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:21,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:21,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 15:08:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:21,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 15:08:21,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:21,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:08:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:21,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925653599] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:08:21,398 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:08:21,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 15:08:21,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72621736] [2022-03-15 15:08:21,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:08:21,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:21,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:21,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:21,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 15:08:21,400 INFO L87 Difference]: Start difference. First operand 2359 states and 4695 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:21,467 INFO L93 Difference]: Finished difference Result 2369 states and 4705 transitions. [2022-03-15 15:08:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:08:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-03-15 15:08:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:21,475 INFO L225 Difference]: With dead ends: 2369 [2022-03-15 15:08:21,475 INFO L226 Difference]: Without dead ends: 2369 [2022-03-15 15:08:21,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-15 15:08:21,476 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 16 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:21,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 704 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-03-15 15:08:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2022-03-15 15:08:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2355 states have (on average 1.9978768577494692) internal successors, (4705), 2368 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4705 transitions. [2022-03-15 15:08:21,517 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4705 transitions. Word has length 40 [2022-03-15 15:08:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:21,518 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 4705 transitions. [2022-03-15 15:08:21,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4705 transitions. [2022-03-15 15:08:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 15:08:21,518 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:21,519 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:21,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 15:08:21,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 15:08:21,731 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash -198306197, now seen corresponding path program 2 times [2022-03-15 15:08:21,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:21,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406008663] [2022-03-15 15:08:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:21,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:21,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406008663] [2022-03-15 15:08:21,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406008663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:21,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379931742] [2022-03-15 15:08:21,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:21,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:21,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:21,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:21,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 15:08:21,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:21,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:21,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 15:08:21,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:21,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:08:21,977 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 15:08:21,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:08:22,017 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 15:08:22,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:08:22,063 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 15:08:22,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:08:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 15:08:22,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:22,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379931742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:22,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:22,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-15 15:08:22,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012156362] [2022-03-15 15:08:22,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:22,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:08:22,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:08:22,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 15:08:22,083 INFO L87 Difference]: Start difference. First operand 2369 states and 4705 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:22,270 INFO L93 Difference]: Finished difference Result 2638 states and 5243 transitions. [2022-03-15 15:08:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:08:22,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-15 15:08:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:22,280 INFO L225 Difference]: With dead ends: 2638 [2022-03-15 15:08:22,280 INFO L226 Difference]: Without dead ends: 2638 [2022-03-15 15:08:22,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 15:08:22,281 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 124 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:22,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 479 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:08:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2022-03-15 15:08:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2502. [2022-03-15 15:08:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2488 states have (on average 1.9979903536977492) internal successors, (4971), 2501 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4971 transitions. [2022-03-15 15:08:22,328 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4971 transitions. Word has length 50 [2022-03-15 15:08:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:22,328 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 4971 transitions. [2022-03-15 15:08:22,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4971 transitions. [2022-03-15 15:08:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 15:08:22,329 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:22,330 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:22,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:22,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:22,547 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 697598481, now seen corresponding path program 1 times [2022-03-15 15:08:22,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:22,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134292934] [2022-03-15 15:08:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:22,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:22,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134292934] [2022-03-15 15:08:22,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134292934] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:22,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804478649] [2022-03-15 15:08:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:22,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:22,635 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:22,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 15:08:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:22,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 15:08:22,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:22,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:08:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:22,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804478649] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:08:22,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:08:22,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 15:08:22,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105952420] [2022-03-15 15:08:22,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:08:22,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:08:22,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:08:22,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:22,907 INFO L87 Difference]: Start difference. First operand 2502 states and 4971 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:23,042 INFO L93 Difference]: Finished difference Result 2522 states and 4991 transitions. [2022-03-15 15:08:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:08:23,042 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-15 15:08:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:23,050 INFO L225 Difference]: With dead ends: 2522 [2022-03-15 15:08:23,050 INFO L226 Difference]: Without dead ends: 2522 [2022-03-15 15:08:23,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-15 15:08:23,051 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 36 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:23,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 938 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-03-15 15:08:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2022-03-15 15:08:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2508 states have (on average 1.9900318979266347) internal successors, (4991), 2521 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4991 transitions. [2022-03-15 15:08:23,090 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4991 transitions. Word has length 50 [2022-03-15 15:08:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:23,090 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4991 transitions. [2022-03-15 15:08:23,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4991 transitions. [2022-03-15 15:08:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-15 15:08:23,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:23,091 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:23,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:23,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:23,308 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:23,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1015929775, now seen corresponding path program 2 times [2022-03-15 15:08:23,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:23,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962802414] [2022-03-15 15:08:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:23,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:23,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962802414] [2022-03-15 15:08:23,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962802414] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:23,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237048727] [2022-03-15 15:08:23,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:23,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:23,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 15:08:23,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:23,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:23,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 15:08:23,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:23,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:08:23,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:08:23,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,736 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:08:23,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:08:23,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,772 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:08:23,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:08:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-15 15:08:23,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:23,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237048727] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:23,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:23,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-15 15:08:23,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760659336] [2022-03-15 15:08:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:23,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:23,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:08:23,798 INFO L87 Difference]: Start difference. First operand 2522 states and 4991 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:24,279 INFO L93 Difference]: Finished difference Result 5451 states and 10849 transitions. [2022-03-15 15:08:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:08:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-03-15 15:08:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:24,298 INFO L225 Difference]: With dead ends: 5451 [2022-03-15 15:08:24,298 INFO L226 Difference]: Without dead ends: 5451 [2022-03-15 15:08:24,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:08:24,299 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 787 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:24,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 1022 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2022-03-15 15:08:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 3341. [2022-03-15 15:08:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3327 states have (on average 1.9924857228734596) internal successors, (6629), 3340 states have internal predecessors, (6629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 6629 transitions. [2022-03-15 15:08:24,381 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 6629 transitions. Word has length 70 [2022-03-15 15:08:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:24,381 INFO L470 AbstractCegarLoop]: Abstraction has 3341 states and 6629 transitions. [2022-03-15 15:08:24,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 6629 transitions. [2022-03-15 15:08:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-15 15:08:24,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:24,383 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:24,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:24,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:24,600 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash -177478757, now seen corresponding path program 1 times [2022-03-15 15:08:24,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:24,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910701686] [2022-03-15 15:08:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:24,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:24,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910701686] [2022-03-15 15:08:24,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910701686] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:24,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992564984] [2022-03-15 15:08:24,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:24,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:24,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:24,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:24,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 15:08:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:24,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 15:08:24,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:24,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:08:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:25,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992564984] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:08:25,051 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:08:25,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-15 15:08:25,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554690378] [2022-03-15 15:08:25,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:08:25,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:08:25,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:25,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:08:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:25,052 INFO L87 Difference]: Start difference. First operand 3341 states and 6629 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:25,259 INFO L93 Difference]: Finished difference Result 3356 states and 6644 transitions. [2022-03-15 15:08:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:08:25,260 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-03-15 15:08:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:25,265 INFO L225 Difference]: With dead ends: 3356 [2022-03-15 15:08:25,265 INFO L226 Difference]: Without dead ends: 3356 [2022-03-15 15:08:25,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:08:25,266 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 40 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:25,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 1058 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2022-03-15 15:08:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3356. [2022-03-15 15:08:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3342 states have (on average 1.988031119090365) internal successors, (6644), 3355 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 6644 transitions. [2022-03-15 15:08:25,343 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 6644 transitions. Word has length 78 [2022-03-15 15:08:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:25,343 INFO L470 AbstractCegarLoop]: Abstraction has 3356 states and 6644 transitions. [2022-03-15 15:08:25,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 6644 transitions. [2022-03-15 15:08:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-15 15:08:25,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:25,344 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:25,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:25,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:25,559 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 26007824, now seen corresponding path program 2 times [2022-03-15 15:08:25,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:25,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231513725] [2022-03-15 15:08:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:25,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:25,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:25,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231513725] [2022-03-15 15:08:25,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231513725] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:25,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:25,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:08:25,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223660624] [2022-03-15 15:08:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:25,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:08:25,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:08:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:25,635 INFO L87 Difference]: Start difference. First operand 3356 states and 6644 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:25,731 INFO L93 Difference]: Finished difference Result 3594 states and 7120 transitions. [2022-03-15 15:08:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:08:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-15 15:08:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:25,738 INFO L225 Difference]: With dead ends: 3594 [2022-03-15 15:08:25,738 INFO L226 Difference]: Without dead ends: 3594 [2022-03-15 15:08:25,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:25,738 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:25,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 398 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:08:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-03-15 15:08:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3480. [2022-03-15 15:08:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3466 states have (on average 1.988459319099827) internal successors, (6892), 3479 states have internal predecessors, (6892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6892 transitions. [2022-03-15 15:08:25,787 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6892 transitions. Word has length 93 [2022-03-15 15:08:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:25,787 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 6892 transitions. [2022-03-15 15:08:25,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6892 transitions. [2022-03-15 15:08:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-15 15:08:25,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:25,788 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:25,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 15:08:25,788 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash 360970443, now seen corresponding path program 1 times [2022-03-15 15:08:25,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:25,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836148013] [2022-03-15 15:08:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:25,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:25,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836148013] [2022-03-15 15:08:25,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836148013] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:25,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:25,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:08:25,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907800045] [2022-03-15 15:08:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:25,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:08:25,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:08:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:25,858 INFO L87 Difference]: Start difference. First operand 3480 states and 6892 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:26,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:26,057 INFO L93 Difference]: Finished difference Result 3912 states and 7756 transitions. [2022-03-15 15:08:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:08:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-15 15:08:26,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:26,064 INFO L225 Difference]: With dead ends: 3912 [2022-03-15 15:08:26,064 INFO L226 Difference]: Without dead ends: 3912 [2022-03-15 15:08:26,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:26,064 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 194 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:26,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 588 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:08:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2022-03-15 15:08:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3714. [2022-03-15 15:08:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3700 states have (on average 1.9891891891891893) internal successors, (7360), 3713 states have internal predecessors, (7360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 7360 transitions. [2022-03-15 15:08:26,117 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 7360 transitions. Word has length 93 [2022-03-15 15:08:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:26,117 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 7360 transitions. [2022-03-15 15:08:26,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 7360 transitions. [2022-03-15 15:08:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:26,119 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:26,119 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:26,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 15:08:26,119 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1199640953, now seen corresponding path program 1 times [2022-03-15 15:08:26,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:26,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774272293] [2022-03-15 15:08:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:26,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:26,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:26,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774272293] [2022-03-15 15:08:26,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774272293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:26,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156324244] [2022-03-15 15:08:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:26,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:26,480 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:26,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 15:08:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:26,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:26,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:26,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:26,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:26,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156324244] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:26,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:26,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:26,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237743359] [2022-03-15 15:08:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:26,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:26,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:26,950 INFO L87 Difference]: Start difference. First operand 3714 states and 7360 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:27,359 INFO L93 Difference]: Finished difference Result 8247 states and 16407 transitions. [2022-03-15 15:08:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:08:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:27,375 INFO L225 Difference]: With dead ends: 8247 [2022-03-15 15:08:27,375 INFO L226 Difference]: Without dead ends: 8247 [2022-03-15 15:08:27,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:08:27,376 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 635 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:27,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 1273 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2022-03-15 15:08:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 3900. [2022-03-15 15:08:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3900 states, 3886 states have (on average 1.9848172928461143) internal successors, (7713), 3899 states have internal predecessors, (7713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 7713 transitions. [2022-03-15 15:08:27,458 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 7713 transitions. Word has length 105 [2022-03-15 15:08:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:27,458 INFO L470 AbstractCegarLoop]: Abstraction has 3900 states and 7713 transitions. [2022-03-15 15:08:27,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-03-15 15:08:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 7713 transitions. [2022-03-15 15:08:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:27,460 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:27,460 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:27,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:27,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:27,677 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -509932149, now seen corresponding path program 1 times [2022-03-15 15:08:27,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:27,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410197892] [2022-03-15 15:08:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:27,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:27,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410197892] [2022-03-15 15:08:27,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410197892] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:27,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796166905] [2022-03-15 15:08:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:27,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:27,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 15:08:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:28,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:28,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:28,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:28,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:28,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796166905] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:28,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:28,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:28,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137203403] [2022-03-15 15:08:28,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:28,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:28,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:28,289 INFO L87 Difference]: Start difference. First operand 3900 states and 7713 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:28,803 INFO L93 Difference]: Finished difference Result 9773 states and 19440 transitions. [2022-03-15 15:08:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:08:28,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:28,822 INFO L225 Difference]: With dead ends: 9773 [2022-03-15 15:08:28,822 INFO L226 Difference]: Without dead ends: 9773 [2022-03-15 15:08:28,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:08:28,823 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 827 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:28,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1345 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2022-03-15 15:08:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 3903. [2022-03-15 15:08:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3889 states have (on average 1.9848290048855748) internal successors, (7719), 3902 states have internal predecessors, (7719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 7719 transitions. [2022-03-15 15:08:28,908 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 7719 transitions. Word has length 105 [2022-03-15 15:08:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:28,909 INFO L470 AbstractCegarLoop]: Abstraction has 3903 states and 7719 transitions. [2022-03-15 15:08:28,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 7719 transitions. [2022-03-15 15:08:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:28,910 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:28,911 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:28,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:29,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 15:08:29,124 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1481321675, now seen corresponding path program 2 times [2022-03-15 15:08:29,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:29,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487911214] [2022-03-15 15:08:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:29,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:29,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487911214] [2022-03-15 15:08:29,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487911214] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:29,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879660357] [2022-03-15 15:08:29,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:29,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:29,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:29,293 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:29,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 15:08:29,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:29,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:29,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:29,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:29,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:29,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:29,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879660357] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:29,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:29,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:29,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380143772] [2022-03-15 15:08:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:29,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:29,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:29,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:29,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:29,691 INFO L87 Difference]: Start difference. First operand 3903 states and 7719 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:30,342 INFO L93 Difference]: Finished difference Result 10247 states and 20388 transitions. [2022-03-15 15:08:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:08:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:30,360 INFO L225 Difference]: With dead ends: 10247 [2022-03-15 15:08:30,360 INFO L226 Difference]: Without dead ends: 10247 [2022-03-15 15:08:30,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:08:30,361 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1057 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:30,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 1473 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-03-15 15:08:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 3905. [2022-03-15 15:08:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 3891 states have (on average 1.9848368028784373) internal successors, (7723), 3904 states have internal predecessors, (7723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 7723 transitions. [2022-03-15 15:08:30,441 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 7723 transitions. Word has length 105 [2022-03-15 15:08:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:30,441 INFO L470 AbstractCegarLoop]: Abstraction has 3905 states and 7723 transitions. [2022-03-15 15:08:30,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 7723 transitions. [2022-03-15 15:08:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:30,443 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:30,443 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:30,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:30,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 15:08:30,651 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash 428011595, now seen corresponding path program 3 times [2022-03-15 15:08:30,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:30,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908908879] [2022-03-15 15:08:30,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:30,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:30,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:30,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908908879] [2022-03-15 15:08:30,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908908879] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:30,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996455297] [2022-03-15 15:08:30,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:08:30,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:30,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:30,752 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:30,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 15:08:30,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:08:30,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:30,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:30,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:31,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 13 treesize of output 9 [2022-03-15 15:08:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:31,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:31,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996455297] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:31,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:31,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:08:31,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210785619] [2022-03-15 15:08:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:31,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:31,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:31,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:31,151 INFO L87 Difference]: Start difference. First operand 3905 states and 7723 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:32,138 INFO L93 Difference]: Finished difference Result 9750 states and 19370 transitions. [2022-03-15 15:08:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:08:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:32,167 INFO L225 Difference]: With dead ends: 9750 [2022-03-15 15:08:32,167 INFO L226 Difference]: Without dead ends: 9750 [2022-03-15 15:08:32,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:08:32,168 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1417 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:32,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1417 Valid, 1518 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:08:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2022-03-15 15:08:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 3925. [2022-03-15 15:08:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3911 states have (on average 1.9800562515980569) internal successors, (7744), 3924 states have internal predecessors, (7744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 7744 transitions. [2022-03-15 15:08:32,249 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 7744 transitions. Word has length 105 [2022-03-15 15:08:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:32,249 INFO L470 AbstractCegarLoop]: Abstraction has 3925 states and 7744 transitions. [2022-03-15 15:08:32,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 7744 transitions. [2022-03-15 15:08:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:32,251 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:32,251 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:32,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:32,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 15:08:32,467 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2091661697, now seen corresponding path program 4 times [2022-03-15 15:08:32,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:32,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073612375] [2022-03-15 15:08:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:32,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:32,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073612375] [2022-03-15 15:08:32,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073612375] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:32,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825875471] [2022-03-15 15:08:32,733 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:08:32,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:32,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:32,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 15:08:32,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:08:32,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:32,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:32,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:33,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:33,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:33,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825875471] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:33,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:33,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:33,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497211489] [2022-03-15 15:08:33,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:33,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:33,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:33,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:33,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:33,157 INFO L87 Difference]: Start difference. First operand 3925 states and 7744 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:34,405 INFO L93 Difference]: Finished difference Result 13148 states and 26142 transitions. [2022-03-15 15:08:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:08:34,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:34,425 INFO L225 Difference]: With dead ends: 13148 [2022-03-15 15:08:34,425 INFO L226 Difference]: Without dead ends: 13148 [2022-03-15 15:08:34,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=373, Invalid=1883, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 15:08:34,427 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 1484 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:34,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1932 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:08:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13148 states. [2022-03-15 15:08:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13148 to 3975. [2022-03-15 15:08:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-15 15:08:34,558 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-15 15:08:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:34,558 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-15 15:08:34,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-15 15:08:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:34,562 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:34,562 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:34,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:34,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 15:08:34,775 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1656374657, now seen corresponding path program 5 times [2022-03-15 15:08:34,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:34,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353218686] [2022-03-15 15:08:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:34,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:34,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353218686] [2022-03-15 15:08:34,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353218686] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:34,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363083882] [2022-03-15 15:08:34,999 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:08:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:35,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:35,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 15:08:35,120 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:08:35,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:35,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:35,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:35,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 13 treesize of output 9 [2022-03-15 15:08:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:35,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:35,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363083882] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:35,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:35,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:35,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114197427] [2022-03-15 15:08:35,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:35,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:35,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:35,407 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:36,122 INFO L93 Difference]: Finished difference Result 12864 states and 25565 transitions. [2022-03-15 15:08:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:08:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:36,140 INFO L225 Difference]: With dead ends: 12864 [2022-03-15 15:08:36,140 INFO L226 Difference]: Without dead ends: 12864 [2022-03-15 15:08:36,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 15:08:36,141 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 1063 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:36,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 1809 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2022-03-15 15:08:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 3977. [2022-03-15 15:08:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3963 states have (on average 1.980317940953823) internal successors, (7848), 3976 states have internal predecessors, (7848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 7848 transitions. [2022-03-15 15:08:36,257 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 7848 transitions. Word has length 105 [2022-03-15 15:08:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:36,258 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 7848 transitions. [2022-03-15 15:08:36,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 7848 transitions. [2022-03-15 15:08:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:36,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:36,261 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:36,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:36,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 15:08:36,478 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1169892031, now seen corresponding path program 6 times [2022-03-15 15:08:36,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:36,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485737614] [2022-03-15 15:08:36,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:36,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:36,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:36,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485737614] [2022-03-15 15:08:36,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485737614] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:36,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752187132] [2022-03-15 15:08:36,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:08:36,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:36,717 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:36,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 15:08:36,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:08:36,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:36,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:36,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:37,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:37,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:37,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752187132] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:37,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:37,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:37,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645239615] [2022-03-15 15:08:37,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:37,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:37,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:37,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:37,115 INFO L87 Difference]: Start difference. First operand 3977 states and 7848 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:38,258 INFO L93 Difference]: Finished difference Result 13826 states and 27441 transitions. [2022-03-15 15:08:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:08:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:38,275 INFO L225 Difference]: With dead ends: 13826 [2022-03-15 15:08:38,276 INFO L226 Difference]: Without dead ends: 13826 [2022-03-15 15:08:38,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=362, Invalid=1894, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 15:08:38,277 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 1305 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:38,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1305 Valid, 2006 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:08:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-03-15 15:08:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 3975. [2022-03-15 15:08:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-15 15:08:38,363 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-15 15:08:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:38,363 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-15 15:08:38,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-15 15:08:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:38,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:38,365 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:38,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:38,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 15:08:38,581 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1363632863, now seen corresponding path program 7 times [2022-03-15 15:08:38,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:38,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492629936] [2022-03-15 15:08:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:38,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:38,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492629936] [2022-03-15 15:08:38,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492629936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:38,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424510847] [2022-03-15 15:08:38,805 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:08:38,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:38,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:38,806 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:38,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 15:08:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:38,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:38,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:39,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:39,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:39,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424510847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:39,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:39,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:39,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431853444] [2022-03-15 15:08:39,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:39,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:39,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:39,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:39,200 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:39,667 INFO L93 Difference]: Finished difference Result 11072 states and 21976 transitions. [2022-03-15 15:08:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:08:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:39,680 INFO L225 Difference]: With dead ends: 11072 [2022-03-15 15:08:39,680 INFO L226 Difference]: Without dead ends: 11072 [2022-03-15 15:08:39,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-03-15 15:08:39,681 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 797 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:39,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 1543 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2022-03-15 15:08:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 3978. [2022-03-15 15:08:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3964 states have (on average 1.9803229061553986) internal successors, (7850), 3977 states have internal predecessors, (7850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 7850 transitions. [2022-03-15 15:08:39,775 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 7850 transitions. Word has length 105 [2022-03-15 15:08:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:39,775 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 7850 transitions. [2022-03-15 15:08:39,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 7850 transitions. [2022-03-15 15:08:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:39,777 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:39,778 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:39,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:39,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:39,991 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:39,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash -61562595, now seen corresponding path program 8 times [2022-03-15 15:08:39,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:39,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370315161] [2022-03-15 15:08:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:40,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:40,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370315161] [2022-03-15 15:08:40,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370315161] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:40,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575578502] [2022-03-15 15:08:40,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:40,233 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:40,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 15:08:40,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:40,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:40,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:40,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:40,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:40,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:40,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575578502] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:40,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:40,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:40,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941140680] [2022-03-15 15:08:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:40,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:40,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:40,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:40,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:40,623 INFO L87 Difference]: Start difference. First operand 3978 states and 7850 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:41,331 INFO L93 Difference]: Finished difference Result 12770 states and 25348 transitions. [2022-03-15 15:08:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:08:41,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:41,347 INFO L225 Difference]: With dead ends: 12770 [2022-03-15 15:08:41,347 INFO L226 Difference]: Without dead ends: 12770 [2022-03-15 15:08:41,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 15:08:41,348 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 931 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:41,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 1833 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:08:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2022-03-15 15:08:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 3980. [2022-03-15 15:08:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3966 states have (on average 1.9803328290468987) internal successors, (7854), 3979 states have internal predecessors, (7854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 7854 transitions. [2022-03-15 15:08:41,454 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 7854 transitions. Word has length 105 [2022-03-15 15:08:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:41,454 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 7854 transitions. [2022-03-15 15:08:41,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 7854 transitions. [2022-03-15 15:08:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:41,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:41,456 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:41,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:41,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:41,657 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1114872675, now seen corresponding path program 9 times [2022-03-15 15:08:41,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:41,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408468261] [2022-03-15 15:08:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:41,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:41,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408468261] [2022-03-15 15:08:41,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408468261] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:41,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112489158] [2022-03-15 15:08:41,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:08:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:41,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:41,813 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:41,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 15:08:41,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:08:41,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:41,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:41,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:42,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:42,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:42,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112489158] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:42,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:42,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:42,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220612575] [2022-03-15 15:08:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:42,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:42,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:42,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:42,218 INFO L87 Difference]: Start difference. First operand 3980 states and 7854 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:43,253 INFO L93 Difference]: Finished difference Result 12273 states and 24330 transitions. [2022-03-15 15:08:43,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:08:43,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:43,268 INFO L225 Difference]: With dead ends: 12273 [2022-03-15 15:08:43,269 INFO L226 Difference]: Without dead ends: 12273 [2022-03-15 15:08:43,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:08:43,270 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 1214 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:43,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1939 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:08:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2022-03-15 15:08:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 3975. [2022-03-15 15:08:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-15 15:08:43,348 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-15 15:08:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:43,349 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-15 15:08:43,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-15 15:08:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:43,350 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:43,351 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:43,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:43,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:43,556 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1959628071, now seen corresponding path program 10 times [2022-03-15 15:08:43,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:43,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218582887] [2022-03-15 15:08:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:43,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:43,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218582887] [2022-03-15 15:08:43,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218582887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:43,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462612477] [2022-03-15 15:08:43,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:08:43,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:43,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:43,831 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:43,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 15:08:43,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:08:43,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:43,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 15:08:43,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:44,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-03-15 15:08:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:44,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:44,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462612477] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:44,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:44,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-15 15:08:44,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47419719] [2022-03-15 15:08:44,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:44,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 15:08:44,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 15:08:44,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:44,206 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:44,755 INFO L93 Difference]: Finished difference Result 9102 states and 18079 transitions. [2022-03-15 15:08:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:08:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:44,766 INFO L225 Difference]: With dead ends: 9102 [2022-03-15 15:08:44,766 INFO L226 Difference]: Without dead ends: 9102 [2022-03-15 15:08:44,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 15:08:44,767 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 747 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:44,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 1269 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2022-03-15 15:08:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 4050. [2022-03-15 15:08:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-15 15:08:44,833 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-15 15:08:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:44,833 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-15 15:08:44,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-15 15:08:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:44,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:44,838 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:44,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:45,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:45,048 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:45,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2128369343, now seen corresponding path program 11 times [2022-03-15 15:08:45,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:45,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580767898] [2022-03-15 15:08:45,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:45,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:45,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:45,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580767898] [2022-03-15 15:08:45,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580767898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:45,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229325876] [2022-03-15 15:08:45,277 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:08:45,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:45,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:45,278 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:45,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 15:08:45,409 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:08:45,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:45,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:45,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:45,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:45,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:45,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229325876] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:45,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:45,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:45,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166500632] [2022-03-15 15:08:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:45,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:45,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:45,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:45,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:45,689 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:46,628 INFO L93 Difference]: Finished difference Result 10156 states and 20144 transitions. [2022-03-15 15:08:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 15:08:46,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:46,647 INFO L225 Difference]: With dead ends: 10156 [2022-03-15 15:08:46,647 INFO L226 Difference]: Without dead ends: 10156 [2022-03-15 15:08:46,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:08:46,648 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1091 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:46,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1622 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:08:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2022-03-15 15:08:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 4050. [2022-03-15 15:08:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-15 15:08:46,712 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-15 15:08:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:46,712 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-15 15:08:46,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-15 15:08:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:46,713 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:46,714 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:46,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:46,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:46,914 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash -16501203, now seen corresponding path program 12 times [2022-03-15 15:08:46,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:46,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797666268] [2022-03-15 15:08:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:47,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:47,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797666268] [2022-03-15 15:08:47,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797666268] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:47,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327039942] [2022-03-15 15:08:47,054 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:08:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:47,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:47,055 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:47,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 15:08:47,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:08:47,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:47,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:47,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:47,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:47,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:47,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327039942] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:47,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:47,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:47,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551363064] [2022-03-15 15:08:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:47,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:47,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:47,439 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:48,427 INFO L93 Difference]: Finished difference Result 14218 states and 28225 transitions. [2022-03-15 15:08:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:08:48,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:48,445 INFO L225 Difference]: With dead ends: 14218 [2022-03-15 15:08:48,446 INFO L226 Difference]: Without dead ends: 14218 [2022-03-15 15:08:48,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:08:48,447 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1402 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:48,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 1988 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:08:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2022-03-15 15:08:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 4054. [2022-03-15 15:08:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 4040 states have (on average 1.9806930693069307) internal successors, (8002), 4053 states have internal predecessors, (8002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 8002 transitions. [2022-03-15 15:08:48,526 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 8002 transitions. Word has length 105 [2022-03-15 15:08:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:48,527 INFO L470 AbstractCegarLoop]: Abstraction has 4054 states and 8002 transitions. [2022-03-15 15:08:48,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 8002 transitions. [2022-03-15 15:08:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:48,528 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:48,528 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:48,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:48,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:48,735 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash -563432145, now seen corresponding path program 13 times [2022-03-15 15:08:48,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:48,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398872263] [2022-03-15 15:08:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:48,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:48,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398872263] [2022-03-15 15:08:48,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398872263] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:48,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875859517] [2022-03-15 15:08:48,882 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:08:48,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:48,883 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:48,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 15:08:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:49,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:49,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:49,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 13 treesize of output 9 [2022-03-15 15:08:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:49,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:49,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875859517] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:49,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:49,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:49,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390365117] [2022-03-15 15:08:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:49,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:49,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:49,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:49,254 INFO L87 Difference]: Start difference. First operand 4054 states and 8002 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:49,753 INFO L93 Difference]: Finished difference Result 9882 states and 19601 transitions. [2022-03-15 15:08:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:08:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:49,767 INFO L225 Difference]: With dead ends: 9882 [2022-03-15 15:08:49,767 INFO L226 Difference]: Without dead ends: 9882 [2022-03-15 15:08:49,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-03-15 15:08:49,768 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 856 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:49,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [856 Valid, 1470 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9882 states. [2022-03-15 15:08:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9882 to 4056. [2022-03-15 15:08:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4042 states have (on average 1.9807026224641266) internal successors, (8006), 4055 states have internal predecessors, (8006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-15 15:08:49,857 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-15 15:08:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:49,858 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-15 15:08:49,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-15 15:08:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:49,860 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:49,860 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:49,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:50,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 15:08:50,067 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1049914771, now seen corresponding path program 14 times [2022-03-15 15:08:50,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:50,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123149908] [2022-03-15 15:08:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:50,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:50,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123149908] [2022-03-15 15:08:50,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123149908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:50,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769088356] [2022-03-15 15:08:50,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:50,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:50,294 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:50,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 15:08:50,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:50,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:50,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:50,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:50,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:50,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:50,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769088356] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:50,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:50,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:50,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850956617] [2022-03-15 15:08:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:50,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:50,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:50,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:50,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:50,734 INFO L87 Difference]: Start difference. First operand 4056 states and 8006 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:51,707 INFO L93 Difference]: Finished difference Result 10977 states and 21724 transitions. [2022-03-15 15:08:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 15:08:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:51,722 INFO L225 Difference]: With dead ends: 10977 [2022-03-15 15:08:51,722 INFO L226 Difference]: Without dead ends: 10977 [2022-03-15 15:08:51,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1456, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:08:51,723 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1081 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:51,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1081 Valid, 1915 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:08:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10977 states. [2022-03-15 15:08:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10977 to 4050. [2022-03-15 15:08:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-15 15:08:51,816 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-15 15:08:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:51,817 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-15 15:08:51,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-15 15:08:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:51,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:51,819 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:51,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 15:08:52,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 15:08:52,035 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash -550224723, now seen corresponding path program 15 times [2022-03-15 15:08:52,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:52,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119535245] [2022-03-15 15:08:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:52,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:52,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119535245] [2022-03-15 15:08:52,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119535245] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:52,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970102296] [2022-03-15 15:08:52,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:08:52,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:52,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:52,276 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:52,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 15:08:52,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:08:52,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:52,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:52,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:52,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:52,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:52,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970102296] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:52,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:52,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:52,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752161803] [2022-03-15 15:08:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:52,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:52,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:52,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:52,671 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:53,786 INFO L93 Difference]: Finished difference Result 12897 states and 25597 transitions. [2022-03-15 15:08:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:08:53,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:53,805 INFO L225 Difference]: With dead ends: 12897 [2022-03-15 15:08:53,805 INFO L226 Difference]: Without dead ends: 12897 [2022-03-15 15:08:53,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 15:08:53,806 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1626 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:53,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 1979 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:08:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2022-03-15 15:08:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 4060. [2022-03-15 15:08:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4046 states have (on average 1.9807217004448838) internal successors, (8014), 4059 states have internal predecessors, (8014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 8014 transitions. [2022-03-15 15:08:53,890 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 8014 transitions. Word has length 105 [2022-03-15 15:08:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:53,890 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 8014 transitions. [2022-03-15 15:08:53,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 8014 transitions. [2022-03-15 15:08:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:53,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:53,892 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:53,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:54,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 15:08:54,092 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1097155665, now seen corresponding path program 16 times [2022-03-15 15:08:54,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:54,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604075258] [2022-03-15 15:08:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:54,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:54,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604075258] [2022-03-15 15:08:54,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604075258] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:54,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103166703] [2022-03-15 15:08:54,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:08:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:54,328 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:54,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 15:08:54,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:08:54,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:54,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 15:08:54,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:54,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:54,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-03-15 15:08:54,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:54,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103166703] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:54,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:54,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2022-03-15 15:08:54,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227467689] [2022-03-15 15:08:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:54,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 15:08:54,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:54,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 15:08:54,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:08:54,718 INFO L87 Difference]: Start difference. First operand 4060 states and 8014 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:55,622 INFO L93 Difference]: Finished difference Result 16275 states and 32325 transitions. [2022-03-15 15:08:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 15:08:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:55,643 INFO L225 Difference]: With dead ends: 16275 [2022-03-15 15:08:55,643 INFO L226 Difference]: Without dead ends: 16275 [2022-03-15 15:08:55,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:08:55,644 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 1363 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:55,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 2184 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:08:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2022-03-15 15:08:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 4062. [2022-03-15 15:08:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4048 states have (on average 1.9807312252964426) internal successors, (8018), 4061 states have internal predecessors, (8018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 8018 transitions. [2022-03-15 15:08:55,744 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 8018 transitions. Word has length 105 [2022-03-15 15:08:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:55,744 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 8018 transitions. [2022-03-15 15:08:55,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 8018 transitions. [2022-03-15 15:08:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:55,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:55,746 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:55,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:55,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:55,963 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1583638291, now seen corresponding path program 17 times [2022-03-15 15:08:55,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:55,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228994007] [2022-03-15 15:08:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:56,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:56,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228994007] [2022-03-15 15:08:56,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228994007] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:56,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872317770] [2022-03-15 15:08:56,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:08:56,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:56,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:56,168 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:56,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 15:08:56,317 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:08:56,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:56,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:56,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:56,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:56,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:56,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872317770] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:56,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:56,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:56,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855823675] [2022-03-15 15:08:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:56,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:56,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:56,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:56,603 INFO L87 Difference]: Start difference. First operand 4062 states and 8018 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:57,700 INFO L93 Difference]: Finished difference Result 13575 states and 26896 transitions. [2022-03-15 15:08:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:08:57,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-03-15 15:08:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:57,719 INFO L225 Difference]: With dead ends: 13575 [2022-03-15 15:08:57,719 INFO L226 Difference]: Without dead ends: 13575 [2022-03-15 15:08:57,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 15:08:57,720 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 1337 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:57,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1337 Valid, 2129 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:08:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2022-03-15 15:08:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 4056. [2022-03-15 15:08:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4042 states have (on average 1.9807026224641266) internal successors, (8006), 4055 states have internal predecessors, (8006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-15 15:08:57,801 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-15 15:08:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:57,801 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-15 15:08:57,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-15 15:08:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:57,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:57,803 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:57,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:58,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 15:08:58,003 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1389897459, now seen corresponding path program 18 times [2022-03-15 15:08:58,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:58,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012020754] [2022-03-15 15:08:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:58,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:58,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012020754] [2022-03-15 15:08:58,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012020754] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:58,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340309613] [2022-03-15 15:08:58,155 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:08:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:58,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:58,156 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:58,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 15:08:58,301 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:08:58,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:58,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:58,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:58,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:58,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:58,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340309613] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:58,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:58,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:58,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193350086] [2022-03-15 15:08:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:58,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:58,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:58,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:58,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:58,561 INFO L87 Difference]: Start difference. First operand 4056 states and 8006 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:58,967 INFO L93 Difference]: Finished difference Result 8414 states and 16665 transitions. [2022-03-15 15:08:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:08:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:58,977 INFO L225 Difference]: With dead ends: 8414 [2022-03-15 15:08:58,977 INFO L226 Difference]: Without dead ends: 8414 [2022-03-15 15:08:58,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:08:58,980 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 642 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:58,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 1493 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2022-03-15 15:08:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 4059. [2022-03-15 15:08:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4045 states have (on average 1.980716934487021) internal successors, (8012), 4058 states have internal predecessors, (8012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 8012 transitions. [2022-03-15 15:08:59,038 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 8012 transitions. Word has length 105 [2022-03-15 15:08:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:59,038 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 8012 transitions. [2022-03-15 15:08:59,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 8012 transitions. [2022-03-15 15:08:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:59,040 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:59,040 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:59,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 15:08:59,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 15:08:59,241 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:08:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1479874379, now seen corresponding path program 19 times [2022-03-15 15:08:59,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:59,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186427133] [2022-03-15 15:08:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:59,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:59,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186427133] [2022-03-15 15:08:59,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186427133] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:59,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169136153] [2022-03-15 15:08:59,514 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:08:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:59,516 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:59,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 15:08:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:59,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:59,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:59,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:59,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:59,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169136153] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:59,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:59,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:59,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420069258] [2022-03-15 15:08:59,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:59,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:59,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:59,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:59,975 INFO L87 Difference]: Start difference. First operand 4059 states and 8012 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:00,613 INFO L93 Difference]: Finished difference Result 10112 states and 20037 transitions. [2022-03-15 15:09:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:09:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:00,625 INFO L225 Difference]: With dead ends: 10112 [2022-03-15 15:09:00,625 INFO L226 Difference]: Without dead ends: 10112 [2022-03-15 15:09:00,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 15:09:00,626 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 821 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:00,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [821 Valid, 1682 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2022-03-15 15:09:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 4061. [2022-03-15 15:09:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4061 states, 4047 states have (on average 1.9807264640474425) internal successors, (8016), 4060 states have internal predecessors, (8016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 8016 transitions. [2022-03-15 15:09:00,689 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 8016 transitions. Word has length 105 [2022-03-15 15:09:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:00,689 INFO L470 AbstractCegarLoop]: Abstraction has 4061 states and 8016 transitions. [2022-03-15 15:09:00,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 8016 transitions. [2022-03-15 15:09:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:00,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:00,691 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:00,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:00,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:00,893 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 426564299, now seen corresponding path program 20 times [2022-03-15 15:09:00,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:00,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565164012] [2022-03-15 15:09:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:01,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:01,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565164012] [2022-03-15 15:09:01,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565164012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:01,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417507974] [2022-03-15 15:09:01,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:01,115 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:01,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 15:09:01,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:01,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:01,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:01,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:01,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:01,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:01,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417507974] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:01,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:01,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:01,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915103806] [2022-03-15 15:09:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:01,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:01,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:01,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:01,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:01,557 INFO L87 Difference]: Start difference. First operand 4061 states and 8016 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:02,583 INFO L93 Difference]: Finished difference Result 9615 states and 19019 transitions. [2022-03-15 15:09:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 15:09:02,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:02,596 INFO L225 Difference]: With dead ends: 9615 [2022-03-15 15:09:02,596 INFO L226 Difference]: Without dead ends: 9615 [2022-03-15 15:09:02,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:09:02,597 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1091 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:02,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1797 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2022-03-15 15:09:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 4050. [2022-03-15 15:09:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-15 15:09:02,668 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-15 15:09:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:02,669 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-15 15:09:02,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-15 15:09:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:02,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:02,671 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:02,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:02,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:02,883 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2124234257, now seen corresponding path program 21 times [2022-03-15 15:09:02,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:02,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686758475] [2022-03-15 15:09:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:02,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:03,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:03,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686758475] [2022-03-15 15:09:03,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686758475] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:03,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221405535] [2022-03-15 15:09:03,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:03,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:03,055 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:03,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 15:09:03,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:03,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:03,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:03,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:03,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:03,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:03,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221405535] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:03,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:03,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:03,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149574345] [2022-03-15 15:09:03,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:03,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:03,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:03,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:03,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:03,496 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:04,023 INFO L93 Difference]: Finished difference Result 7878 states and 15626 transitions. [2022-03-15 15:09:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:09:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:04,032 INFO L225 Difference]: With dead ends: 7878 [2022-03-15 15:09:04,032 INFO L226 Difference]: Without dead ends: 7878 [2022-03-15 15:09:04,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:04,033 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 827 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:04,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1648 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-03-15 15:09:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4086. [2022-03-15 15:09:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-15 15:09:04,082 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-15 15:09:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:04,082 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-15 15:09:04,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-15 15:09:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:04,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:04,084 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:04,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 15:09:04,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:04,284 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1798897081, now seen corresponding path program 22 times [2022-03-15 15:09:04,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:04,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838717290] [2022-03-15 15:09:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:04,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:04,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838717290] [2022-03-15 15:09:04,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838717290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:04,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362463767] [2022-03-15 15:09:04,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:09:04,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:04,551 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:04,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 15:09:04,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:09:04,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:04,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 15:09:04,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:04,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:04,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:04,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362463767] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:04,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:04,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-15 15:09:04,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338218711] [2022-03-15 15:09:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:04,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 15:09:04,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 15:09:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:04,999 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:05,808 INFO L93 Difference]: Finished difference Result 9039 states and 17934 transitions. [2022-03-15 15:09:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 15:09:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:05,837 INFO L225 Difference]: With dead ends: 9039 [2022-03-15 15:09:05,837 INFO L226 Difference]: Without dead ends: 9039 [2022-03-15 15:09:05,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 15:09:05,838 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 1028 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:05,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1028 Valid, 1612 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2022-03-15 15:09:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 4089. [2022-03-15 15:09:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 4075 states have (on average 1.9808588957055215) internal successors, (8072), 4088 states have internal predecessors, (8072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 8072 transitions. [2022-03-15 15:09:05,910 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 8072 transitions. Word has length 105 [2022-03-15 15:09:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:05,911 INFO L470 AbstractCegarLoop]: Abstraction has 4089 states and 8072 transitions. [2022-03-15 15:09:05,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 8072 transitions. [2022-03-15 15:09:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:05,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:05,912 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:05,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:06,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:06,113 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2005866963, now seen corresponding path program 23 times [2022-03-15 15:09:06,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:06,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196236398] [2022-03-15 15:09:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:06,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:06,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196236398] [2022-03-15 15:09:06,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196236398] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:06,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607730849] [2022-03-15 15:09:06,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:09:06,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:06,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:06,326 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:06,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 15:09:06,521 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:09:06,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:06,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:06,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:06,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:06,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:06,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607730849] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:06,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:06,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:06,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982546580] [2022-03-15 15:09:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:06,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:06,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:06,816 INFO L87 Difference]: Start difference. First operand 4089 states and 8072 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:07,978 INFO L93 Difference]: Finished difference Result 9474 states and 18775 transitions. [2022-03-15 15:09:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:09:07,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:07,990 INFO L225 Difference]: With dead ends: 9474 [2022-03-15 15:09:07,990 INFO L226 Difference]: Without dead ends: 9474 [2022-03-15 15:09:07,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1876, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 15:09:07,991 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1402 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:07,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 1934 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states. [2022-03-15 15:09:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 4086. [2022-03-15 15:09:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-15 15:09:08,054 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-15 15:09:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:08,055 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-15 15:09:08,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-15 15:09:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:08,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:08,056 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:08,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 15:09:08,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 15:09:08,257 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2128263501, now seen corresponding path program 24 times [2022-03-15 15:09:08,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:08,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453071315] [2022-03-15 15:09:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:08,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:08,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453071315] [2022-03-15 15:09:08,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453071315] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:08,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909931544] [2022-03-15 15:09:08,418 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:09:08,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:08,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:08,420 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:08,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 15:09:08,583 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:09:08,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:08,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:08,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:08,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:08,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:08,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909931544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:08,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:08,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:08,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029051301] [2022-03-15 15:09:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:08,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:08,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:08,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:08,871 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:09,342 INFO L93 Difference]: Finished difference Result 8122 states and 16081 transitions. [2022-03-15 15:09:09,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:09:09,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:09,353 INFO L225 Difference]: With dead ends: 8122 [2022-03-15 15:09:09,353 INFO L226 Difference]: Without dead ends: 8122 [2022-03-15 15:09:09,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:09,354 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 714 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:09,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [714 Valid, 1686 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2022-03-15 15:09:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4095. [2022-03-15 15:09:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 4081 states have (on average 1.9808870374908112) internal successors, (8084), 4094 states have internal predecessors, (8084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 8084 transitions. [2022-03-15 15:09:09,415 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 8084 transitions. Word has length 105 [2022-03-15 15:09:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:09,415 INFO L470 AbstractCegarLoop]: Abstraction has 4095 states and 8084 transitions. [2022-03-15 15:09:09,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 8084 transitions. [2022-03-15 15:09:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:09,417 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:09,417 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:09,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 15:09:09,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:09,631 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:09,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1959733913, now seen corresponding path program 25 times [2022-03-15 15:09:09,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:09,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671896328] [2022-03-15 15:09:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:09,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:09,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671896328] [2022-03-15 15:09:09,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671896328] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:09,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332681531] [2022-03-15 15:09:09,738 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:09:09,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:09,752 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:09,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 15:09:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:09,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:09,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:10,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:10,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:10,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332681531] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:10,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:10,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:10,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787512088] [2022-03-15 15:09:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:10,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:10,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:10,196 INFO L87 Difference]: Start difference. First operand 4095 states and 8084 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:11,224 INFO L93 Difference]: Finished difference Result 11081 states and 21956 transitions. [2022-03-15 15:09:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:09:11,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:11,248 INFO L225 Difference]: With dead ends: 11081 [2022-03-15 15:09:11,248 INFO L226 Difference]: Without dead ends: 11081 [2022-03-15 15:09:11,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:09:11,249 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1397 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:11,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 1899 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11081 states. [2022-03-15 15:09:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11081 to 4092. [2022-03-15 15:09:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-15 15:09:11,333 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-15 15:09:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:11,333 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-15 15:09:11,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-15 15:09:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:11,335 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:11,335 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:11,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:11,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:11,548 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -185136633, now seen corresponding path program 26 times [2022-03-15 15:09:11,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:11,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415021576] [2022-03-15 15:09:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:11,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:11,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415021576] [2022-03-15 15:09:11,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415021576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:11,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121271456] [2022-03-15 15:09:11,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:11,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:11,654 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:11,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 15:09:11,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:11,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:11,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:11,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:12,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:12,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:12,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121271456] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:12,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:12,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:12,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875135450] [2022-03-15 15:09:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:12,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:12,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:12,080 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:13,209 INFO L93 Difference]: Finished difference Result 13372 states and 26547 transitions. [2022-03-15 15:09:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 15:09:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:13,228 INFO L225 Difference]: With dead ends: 13372 [2022-03-15 15:09:13,228 INFO L226 Difference]: Without dead ends: 13372 [2022-03-15 15:09:13,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 15:09:13,229 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 1599 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:13,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 2049 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2022-03-15 15:09:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 4096. [2022-03-15 15:09:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4096 states, 4082 states have (on average 1.980891719745223) internal successors, (8086), 4095 states have internal predecessors, (8086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 8086 transitions. [2022-03-15 15:09:13,311 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 8086 transitions. Word has length 105 [2022-03-15 15:09:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:13,311 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 8086 transitions. [2022-03-15 15:09:13,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 8086 transitions. [2022-03-15 15:09:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:13,313 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:13,313 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:13,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-15 15:09:13,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 15:09:13,514 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -732067575, now seen corresponding path program 27 times [2022-03-15 15:09:13,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:13,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707690094] [2022-03-15 15:09:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:13,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:13,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707690094] [2022-03-15 15:09:13,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707690094] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:13,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951417906] [2022-03-15 15:09:13,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:13,735 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:13,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 15:09:13,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:13,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:13,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:13,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:14,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:14,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:14,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951417906] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:14,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:14,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:14,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598714915] [2022-03-15 15:09:14,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:14,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:14,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:14,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:14,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:14,186 INFO L87 Difference]: Start difference. First operand 4096 states and 8086 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:14,859 INFO L93 Difference]: Finished difference Result 9134 states and 18105 transitions. [2022-03-15 15:09:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:09:14,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:14,871 INFO L225 Difference]: With dead ends: 9134 [2022-03-15 15:09:14,872 INFO L226 Difference]: Without dead ends: 9134 [2022-03-15 15:09:14,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 15:09:14,872 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1087 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:14,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 1762 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9134 states. [2022-03-15 15:09:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9134 to 4098. [2022-03-15 15:09:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4084 states have (on average 1.9809010773751223) internal successors, (8090), 4097 states have internal predecessors, (8090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8090 transitions. [2022-03-15 15:09:14,958 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8090 transitions. Word has length 105 [2022-03-15 15:09:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:14,958 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 8090 transitions. [2022-03-15 15:09:14,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8090 transitions. [2022-03-15 15:09:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:14,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:14,960 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:14,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 15:09:15,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 15:09:15,160 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1218550201, now seen corresponding path program 28 times [2022-03-15 15:09:15,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:15,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748110165] [2022-03-15 15:09:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:15,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:15,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748110165] [2022-03-15 15:09:15,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748110165] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:15,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174475981] [2022-03-15 15:09:15,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:09:15,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:15,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:15,247 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:15,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 15:09:15,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:09:15,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:15,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 15:09:15,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:15,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:15,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:15,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174475981] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:15,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:15,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-15 15:09:15,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162842663] [2022-03-15 15:09:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:15,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 15:09:15,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 15:09:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:09:15,606 INFO L87 Difference]: Start difference. First operand 4098 states and 8090 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:16,640 INFO L93 Difference]: Finished difference Result 12493 states and 24756 transitions. [2022-03-15 15:09:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 15:09:16,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:16,658 INFO L225 Difference]: With dead ends: 12493 [2022-03-15 15:09:16,658 INFO L226 Difference]: Without dead ends: 12493 [2022-03-15 15:09:16,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 15:09:16,659 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 1251 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:16,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 2202 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:09:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2022-03-15 15:09:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 4086. [2022-03-15 15:09:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-15 15:09:16,735 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-15 15:09:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:16,735 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-15 15:09:16,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-15 15:09:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:16,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:16,737 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:16,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 15:09:16,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 15:09:16,937 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:16,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash 704398933, now seen corresponding path program 29 times [2022-03-15 15:09:16,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:16,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552121070] [2022-03-15 15:09:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:17,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:17,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552121070] [2022-03-15 15:09:17,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552121070] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:17,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535168702] [2022-03-15 15:09:17,096 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:09:17,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:17,097 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:17,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 15:09:17,311 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:09:17,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:17,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:17,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:17,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:17,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:17,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535168702] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:17,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:17,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:17,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445940527] [2022-03-15 15:09:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:17,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:17,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:17,586 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:18,011 INFO L93 Difference]: Finished difference Result 7570 states and 14977 transitions. [2022-03-15 15:09:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:09:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:18,020 INFO L225 Difference]: With dead ends: 7570 [2022-03-15 15:09:18,020 INFO L226 Difference]: Without dead ends: 7570 [2022-03-15 15:09:18,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:09:18,021 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 612 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:18,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 1626 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2022-03-15 15:09:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 4091. [2022-03-15 15:09:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4077 states have (on average 1.9808682855040471) internal successors, (8076), 4090 states have internal predecessors, (8076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-15 15:09:18,069 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-15 15:09:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:18,069 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-15 15:09:18,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-15 15:09:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:18,071 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:18,071 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:18,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:18,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 15:09:18,271 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 497429051, now seen corresponding path program 30 times [2022-03-15 15:09:18,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:18,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460057552] [2022-03-15 15:09:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:18,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:18,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460057552] [2022-03-15 15:09:18,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460057552] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:18,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587459217] [2022-03-15 15:09:18,358 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:09:18,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:18,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:18,359 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:18,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 15:09:18,525 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:09:18,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:18,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:18,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:18,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:18,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:18,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587459217] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:18,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:18,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:18,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613440007] [2022-03-15 15:09:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:18,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:18,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:18,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:18,804 INFO L87 Difference]: Start difference. First operand 4091 states and 8076 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:19,713 INFO L93 Difference]: Finished difference Result 10529 states and 20852 transitions. [2022-03-15 15:09:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 15:09:19,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:19,730 INFO L225 Difference]: With dead ends: 10529 [2022-03-15 15:09:19,730 INFO L226 Difference]: Without dead ends: 10529 [2022-03-15 15:09:19,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 15:09:19,731 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 1307 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:19,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1307 Valid, 1861 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:09:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2022-03-15 15:09:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 4088. [2022-03-15 15:09:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4074 states have (on average 1.9808541973490428) internal successors, (8070), 4087 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-15 15:09:19,813 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-15 15:09:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:19,813 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-15 15:09:19,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-15 15:09:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:19,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:19,815 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:19,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:20,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:20,032 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1647441495, now seen corresponding path program 31 times [2022-03-15 15:09:20,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:20,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898330053] [2022-03-15 15:09:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:20,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:20,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898330053] [2022-03-15 15:09:20,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898330053] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:20,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126138293] [2022-03-15 15:09:20,228 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:09:20,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:20,230 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:20,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 15:09:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:20,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:20,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:20,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:20,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:20,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126138293] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:20,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:20,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:20,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060718911] [2022-03-15 15:09:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:20,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:20,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:20,695 INFO L87 Difference]: Start difference. First operand 4088 states and 8070 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:21,812 INFO L93 Difference]: Finished difference Result 14591 states and 28933 transitions. [2022-03-15 15:09:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:09:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:21,831 INFO L225 Difference]: With dead ends: 14591 [2022-03-15 15:09:21,831 INFO L226 Difference]: Without dead ends: 14591 [2022-03-15 15:09:21,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 15:09:21,832 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 1595 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:21,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1595 Valid, 2224 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2022-03-15 15:09:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 4092. [2022-03-15 15:09:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-15 15:09:21,911 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-15 15:09:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:21,911 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-15 15:09:21,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-15 15:09:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:21,913 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:21,913 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:21,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:22,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 15:09:22,130 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2100594859, now seen corresponding path program 32 times [2022-03-15 15:09:22,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:22,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742908326] [2022-03-15 15:09:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:22,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:22,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742908326] [2022-03-15 15:09:22,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742908326] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:22,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267154841] [2022-03-15 15:09:22,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:22,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:22,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:22,328 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:22,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 15:09:22,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:22,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:22,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:22,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:22,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:22,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:22,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267154841] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:22,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:22,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:22,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868642423] [2022-03-15 15:09:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:22,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:22,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:22,804 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:23,415 INFO L93 Difference]: Finished difference Result 10255 states and 20309 transitions. [2022-03-15 15:09:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:09:23,415 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:23,427 INFO L225 Difference]: With dead ends: 10255 [2022-03-15 15:09:23,428 INFO L226 Difference]: Without dead ends: 10255 [2022-03-15 15:09:23,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 15:09:23,428 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1019 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:23,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1019 Valid, 1835 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-03-15 15:09:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 4094. [2022-03-15 15:09:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4080 states have (on average 1.9808823529411765) internal successors, (8082), 4093 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-15 15:09:23,491 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-15 15:09:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:23,491 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-15 15:09:23,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-15 15:09:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:23,492 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:23,493 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:23,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:23,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 15:09:23,696 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1614112233, now seen corresponding path program 33 times [2022-03-15 15:09:23,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:23,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847763010] [2022-03-15 15:09:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:23,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:23,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847763010] [2022-03-15 15:09:23,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847763010] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:23,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415780005] [2022-03-15 15:09:23,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:23,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:23,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:23,778 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:23,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 15:09:23,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:23,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:23,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:23,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:24,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:24,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-03-15 15:09:24,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:24,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415780005] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:24,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:24,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:24,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768426207] [2022-03-15 15:09:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:24,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:24,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:24,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:24,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:24,194 INFO L87 Difference]: Start difference. First operand 4094 states and 8082 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:25,234 INFO L93 Difference]: Finished difference Result 11350 states and 22432 transitions. [2022-03-15 15:09:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 15:09:25,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-03-15 15:09:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:25,245 INFO L225 Difference]: With dead ends: 11350 [2022-03-15 15:09:25,245 INFO L226 Difference]: Without dead ends: 11350 [2022-03-15 15:09:25,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1195, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 15:09:25,245 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1220 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:25,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 2165 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11350 states. [2022-03-15 15:09:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11350 to 4082. [2022-03-15 15:09:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4068 states have (on average 1.980825958702065) internal successors, (8058), 4081 states have internal predecessors, (8058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 8058 transitions. [2022-03-15 15:09:25,306 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 8058 transitions. Word has length 105 [2022-03-15 15:09:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:25,307 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 8058 transitions. [2022-03-15 15:09:25,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 8058 transitions. [2022-03-15 15:09:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:25,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:25,308 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:25,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:25,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 15:09:25,509 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2113802281, now seen corresponding path program 34 times [2022-03-15 15:09:25,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:25,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951255344] [2022-03-15 15:09:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:25,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:25,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951255344] [2022-03-15 15:09:25,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951255344] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:25,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136774607] [2022-03-15 15:09:25,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:09:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:25,592 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:25,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 15:09:25,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:09:25,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:25,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 15:09:25,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:25,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:25,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:25,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136774607] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:25,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:25,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-15 15:09:25,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438476468] [2022-03-15 15:09:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:25,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 15:09:25,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 15:09:25,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:09:25,973 INFO L87 Difference]: Start difference. First operand 4082 states and 8058 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:26,895 INFO L93 Difference]: Finished difference Result 15159 states and 30102 transitions. [2022-03-15 15:09:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:09:26,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:26,915 INFO L225 Difference]: With dead ends: 15159 [2022-03-15 15:09:26,916 INFO L226 Difference]: Without dead ends: 15159 [2022-03-15 15:09:26,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:09:26,916 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 1559 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:26,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 2491 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2022-03-15 15:09:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 4092. [2022-03-15 15:09:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-15 15:09:27,003 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-15 15:09:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:27,003 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-15 15:09:27,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-15 15:09:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:27,004 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:27,005 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:27,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 15:09:27,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:27,205 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1566871339, now seen corresponding path program 35 times [2022-03-15 15:09:27,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:27,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138701322] [2022-03-15 15:09:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:27,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:27,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:27,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138701322] [2022-03-15 15:09:27,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138701322] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:27,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867888119] [2022-03-15 15:09:27,390 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:09:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:27,391 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:27,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 15:09:27,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:09:27,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:27,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:27,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:27,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:27,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:27,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867888119] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:27,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:27,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:27,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589634310] [2022-03-15 15:09:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:27,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:27,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:27,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:27,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:27,861 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:28,505 INFO L93 Difference]: Finished difference Result 12497 states and 24788 transitions. [2022-03-15 15:09:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:09:28,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:28,521 INFO L225 Difference]: With dead ends: 12497 [2022-03-15 15:09:28,521 INFO L226 Difference]: Without dead ends: 12497 [2022-03-15 15:09:28,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 15:09:28,521 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1045 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:28,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 1919 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-03-15 15:09:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 4094. [2022-03-15 15:09:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4080 states have (on average 1.9808823529411765) internal successors, (8082), 4093 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-15 15:09:28,592 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-15 15:09:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:28,593 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-15 15:09:28,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-15 15:09:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:28,594 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:28,594 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:28,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-15 15:09:28,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:28,795 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1080388713, now seen corresponding path program 36 times [2022-03-15 15:09:28,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:28,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122892896] [2022-03-15 15:09:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:28,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:28,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122892896] [2022-03-15 15:09:28,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122892896] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:28,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158004521] [2022-03-15 15:09:28,992 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:09:28,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:28,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:28,994 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:29,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 15:09:29,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:09:29,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:29,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:29,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:29,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:29,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:29,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158004521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:29,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:29,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:29,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988188076] [2022-03-15 15:09:29,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:29,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:29,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:29,446 INFO L87 Difference]: Start difference. First operand 4094 states and 8082 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:30,526 INFO L93 Difference]: Finished difference Result 13459 states and 26664 transitions. [2022-03-15 15:09:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 15:09:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:30,544 INFO L225 Difference]: With dead ends: 13459 [2022-03-15 15:09:30,544 INFO L226 Difference]: Without dead ends: 13459 [2022-03-15 15:09:30,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 15:09:30,545 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1335 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:30,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1335 Valid, 2209 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:09:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2022-03-15 15:09:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 4088. [2022-03-15 15:09:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4074 states have (on average 1.9808541973490428) internal successors, (8070), 4087 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-15 15:09:30,622 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-15 15:09:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:30,622 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-15 15:09:30,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-15 15:09:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:30,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:30,624 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:30,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 15:09:30,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 15:09:30,824 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1274129545, now seen corresponding path program 37 times [2022-03-15 15:09:30,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:30,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210421716] [2022-03-15 15:09:30,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:30,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:30,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210421716] [2022-03-15 15:09:30,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210421716] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:30,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744232036] [2022-03-15 15:09:30,957 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:09:30,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:30,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:30,959 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:30,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 15:09:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:31,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:31,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:31,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:31,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:31,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744232036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:31,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:31,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:31,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693819163] [2022-03-15 15:09:31,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:31,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:31,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:31,405 INFO L87 Difference]: Start difference. First operand 4088 states and 8070 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:31,804 INFO L93 Difference]: Finished difference Result 8298 states and 16433 transitions. [2022-03-15 15:09:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:09:31,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:31,814 INFO L225 Difference]: With dead ends: 8298 [2022-03-15 15:09:31,814 INFO L226 Difference]: Without dead ends: 8298 [2022-03-15 15:09:31,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:09:31,814 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 656 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:31,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 1447 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2022-03-15 15:09:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 4091. [2022-03-15 15:09:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4077 states have (on average 1.9808682855040471) internal successors, (8076), 4090 states have internal predecessors, (8076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-15 15:09:31,873 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-15 15:09:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:31,873 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-15 15:09:31,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-15 15:09:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:31,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:31,875 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:31,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-15 15:09:32,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 15:09:32,089 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash -151065913, now seen corresponding path program 38 times [2022-03-15 15:09:32,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:32,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607686310] [2022-03-15 15:09:32,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:32,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:32,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607686310] [2022-03-15 15:09:32,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607686310] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:32,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025318497] [2022-03-15 15:09:32,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:32,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:32,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:32,280 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:32,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 15:09:32,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:32,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:32,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:32,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:32,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:32,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:32,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025318497] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:32,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:32,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:09:32,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361053145] [2022-03-15 15:09:32,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:32,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:32,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:32,742 INFO L87 Difference]: Start difference. First operand 4091 states and 8076 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:33,319 INFO L93 Difference]: Finished difference Result 9996 states and 19805 transitions. [2022-03-15 15:09:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:09:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:33,331 INFO L225 Difference]: With dead ends: 9996 [2022-03-15 15:09:33,331 INFO L226 Difference]: Without dead ends: 9996 [2022-03-15 15:09:33,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:09:33,332 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 859 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:33,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1586 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2022-03-15 15:09:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 4093. [2022-03-15 15:09:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 4079 states have (on average 1.980877666094631) internal successors, (8080), 4092 states have internal predecessors, (8080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 8080 transitions. [2022-03-15 15:09:33,392 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 8080 transitions. Word has length 105 [2022-03-15 15:09:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:33,393 INFO L470 AbstractCegarLoop]: Abstraction has 4093 states and 8080 transitions. [2022-03-15 15:09:33,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 8080 transitions. [2022-03-15 15:09:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:33,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:33,394 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:33,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-03-15 15:09:33,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 15:09:33,595 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:33,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1204375993, now seen corresponding path program 39 times [2022-03-15 15:09:33,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:33,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675476286] [2022-03-15 15:09:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:33,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:33,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675476286] [2022-03-15 15:09:33,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675476286] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:33,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067046228] [2022-03-15 15:09:33,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:33,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:33,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:33,722 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:33,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 15:09:33,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:33,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:33,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:33,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:34,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:34,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:34,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067046228] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:34,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:34,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:34,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013387457] [2022-03-15 15:09:34,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:34,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:34,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:34,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:34,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:34,165 INFO L87 Difference]: Start difference. First operand 4093 states and 8080 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:35,042 INFO L93 Difference]: Finished difference Result 9499 states and 18787 transitions. [2022-03-15 15:09:35,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 15:09:35,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:35,054 INFO L225 Difference]: With dead ends: 9499 [2022-03-15 15:09:35,054 INFO L226 Difference]: Without dead ends: 9499 [2022-03-15 15:09:35,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 15:09:35,055 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 1102 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:35,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 1703 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:09:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2022-03-15 15:09:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 4073. [2022-03-15 15:09:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4059 states have (on average 1.9807834441980783) internal successors, (8040), 4072 states have internal predecessors, (8040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 8040 transitions. [2022-03-15 15:09:35,113 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 8040 transitions. Word has length 105 [2022-03-15 15:09:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:35,113 INFO L470 AbstractCegarLoop]: Abstraction has 4073 states and 8040 transitions. [2022-03-15 15:09:35,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 8040 transitions. [2022-03-15 15:09:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-15 15:09:35,115 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:35,115 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:35,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:35,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:35,315 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1890126863, now seen corresponding path program 1 times [2022-03-15 15:09:35,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:35,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982180234] [2022-03-15 15:09:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:35,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:35,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:35,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982180234] [2022-03-15 15:09:35,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982180234] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:35,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812646398] [2022-03-15 15:09:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:35,349 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:35,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 15:09:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:35,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 15:09:35,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:35,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:09:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:35,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812646398] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:09:35,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:09:35,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 15:09:35,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677750739] [2022-03-15 15:09:35,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:09:35,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:35,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 15:09:35,839 INFO L87 Difference]: Start difference. First operand 4073 states and 8040 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:35,907 INFO L93 Difference]: Finished difference Result 7477 states and 14848 transitions. [2022-03-15 15:09:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:09:35,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-03-15 15:09:35,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:35,916 INFO L225 Difference]: With dead ends: 7477 [2022-03-15 15:09:35,916 INFO L226 Difference]: Without dead ends: 7477 [2022-03-15 15:09:35,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-15 15:09:35,917 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 496 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:35,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 1111 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:09:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-15 15:09:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7321. [2022-03-15 15:09:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 7307 states have (on average 2.0106746954974684) internal successors, (14692), 7320 states have internal predecessors, (14692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 14692 transitions. [2022-03-15 15:09:35,994 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 14692 transitions. Word has length 110 [2022-03-15 15:09:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:35,994 INFO L470 AbstractCegarLoop]: Abstraction has 7321 states and 14692 transitions. [2022-03-15 15:09:35,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 14692 transitions. [2022-03-15 15:09:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 15:09:35,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:35,996 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:36,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-15 15:09:36,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:36,197 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash -621139911, now seen corresponding path program 1 times [2022-03-15 15:09:36,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:36,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859475649] [2022-03-15 15:09:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-03-15 15:09:36,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:36,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859475649] [2022-03-15 15:09:36,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859475649] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:36,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:36,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:36,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885847298] [2022-03-15 15:09:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:36,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:36,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:36,263 INFO L87 Difference]: Start difference. First operand 7321 states and 14692 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:36,438 INFO L93 Difference]: Finished difference Result 8193 states and 16446 transitions. [2022-03-15 15:09:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-15 15:09:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:36,449 INFO L225 Difference]: With dead ends: 8193 [2022-03-15 15:09:36,449 INFO L226 Difference]: Without dead ends: 7610 [2022-03-15 15:09:36,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:36,450 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 200 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:36,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 509 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:09:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-15 15:09:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6942. [2022-03-15 15:09:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6942 states, 6929 states have (on average 2.012122961466301) internal successors, (13942), 6941 states have internal predecessors, (13942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 13942 transitions. [2022-03-15 15:09:36,550 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 13942 transitions. Word has length 114 [2022-03-15 15:09:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:36,550 INFO L470 AbstractCegarLoop]: Abstraction has 6942 states and 13942 transitions. [2022-03-15 15:09:36,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 13942 transitions. [2022-03-15 15:09:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:09:36,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:36,553 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:36,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-15 15:09:36,553 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash 278963169, now seen corresponding path program 1 times [2022-03-15 15:09:36,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:36,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14594286] [2022-03-15 15:09:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:36,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:36,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14594286] [2022-03-15 15:09:36,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14594286] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:36,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140829101] [2022-03-15 15:09:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:36,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:36,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:36,822 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:36,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 15:09:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:37,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 15:09:37,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:37,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:37,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:37,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:37,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:37,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:38,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:38,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 15:09:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:38,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:09:38,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:39,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140829101] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:09:39,104 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:09:39,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-15 15:09:39,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427420448] [2022-03-15 15:09:39,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:09:39,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 15:09:39,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 15:09:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:09:39,105 INFO L87 Difference]: Start difference. First operand 6942 states and 13942 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:43,331 INFO L93 Difference]: Finished difference Result 16196 states and 32438 transitions. [2022-03-15 15:09:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 15:09:43,332 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:09:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:43,354 INFO L225 Difference]: With dead ends: 16196 [2022-03-15 15:09:43,354 INFO L226 Difference]: Without dead ends: 16152 [2022-03-15 15:09:43,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1235, Invalid=5905, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 15:09:43,355 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 3300 mSDsluCounter, 4833 mSDsCounter, 0 mSdLazyCounter, 5396 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3300 SdHoareTripleChecker+Valid, 5232 SdHoareTripleChecker+Invalid, 6623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 5396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1062 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:43,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3300 Valid, 5232 Invalid, 6623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 5396 Invalid, 0 Unknown, 1062 Unchecked, 2.4s Time] [2022-03-15 15:09:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2022-03-15 15:09:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 8702. [2022-03-15 15:09:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8702 states, 8689 states have (on average 2.0252042812751756) internal successors, (17597), 8701 states have internal predecessors, (17597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 17597 transitions. [2022-03-15 15:09:43,483 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 17597 transitions. Word has length 134 [2022-03-15 15:09:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:43,484 INFO L470 AbstractCegarLoop]: Abstraction has 8702 states and 17597 transitions. [2022-03-15 15:09:43,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 17597 transitions. [2022-03-15 15:09:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:09:43,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:43,487 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:43,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-03-15 15:09:43,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:43,688 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash 277245459, now seen corresponding path program 2 times [2022-03-15 15:09:43,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:43,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968928203] [2022-03-15 15:09:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:43,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:43,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968928203] [2022-03-15 15:09:43,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968928203] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:43,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694876904] [2022-03-15 15:09:43,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:43,883 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:43,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 15:09:44,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 15:09:44,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:44,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 15:09:44,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:44,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:44,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:44,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:44,835 INFO L353 Elim1Store]: treesize reduction 122, result has 17.6 percent of original size [2022-03-15 15:09:44,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 47 [2022-03-15 15:09:44,883 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 15:09:44,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:44,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:09:45,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:45,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:45,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:45,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:45,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694876904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:09:45,601 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:09:45,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-15 15:09:45,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309052726] [2022-03-15 15:09:45,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:09:45,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 15:09:45,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:45,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 15:09:45,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 15:09:45,603 INFO L87 Difference]: Start difference. First operand 8702 states and 17597 transitions. Second operand has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:49,987 INFO L93 Difference]: Finished difference Result 15900 states and 31856 transitions. [2022-03-15 15:09:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 15:09:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:09:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:50,010 INFO L225 Difference]: With dead ends: 15900 [2022-03-15 15:09:50,010 INFO L226 Difference]: Without dead ends: 15867 [2022-03-15 15:09:50,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1261, Invalid=5879, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 15:09:50,011 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 3853 mSDsluCounter, 5316 mSDsCounter, 0 mSdLazyCounter, 6025 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3853 SdHoareTripleChecker+Valid, 5704 SdHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 6025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 660 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:50,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3853 Valid, 5704 Invalid, 6964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 6025 Invalid, 0 Unknown, 660 Unchecked, 2.7s Time] [2022-03-15 15:09:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15867 states. [2022-03-15 15:09:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 8712. [2022-03-15 15:09:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 8699 states have (on average 2.024830440280492) internal successors, (17614), 8711 states have internal predecessors, (17614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 17614 transitions. [2022-03-15 15:09:50,201 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 17614 transitions. Word has length 134 [2022-03-15 15:09:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:50,202 INFO L470 AbstractCegarLoop]: Abstraction has 8712 states and 17614 transitions. [2022-03-15 15:09:50,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 17614 transitions. [2022-03-15 15:09:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:09:50,205 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:50,205 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:50,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:50,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 15:09:50,406 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1655652432, now seen corresponding path program 1 times [2022-03-15 15:09:50,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:50,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590853083] [2022-03-15 15:09:50,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:50,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:50,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:50,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590853083] [2022-03-15 15:09:50,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590853083] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:50,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991962594] [2022-03-15 15:09:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:50,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:50,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:50,592 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:50,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 15:09:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:50,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 15:09:50,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:51,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-03-15 15:09:51,385 INFO L353 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-03-15 15:09:51,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-03-15 15:09:51,414 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 15:09:51,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:51,451 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 15:09:51,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:51,499 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 15:09:51,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:51,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:09:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:51,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991962594] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:09:51,931 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:09:51,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2022-03-15 15:09:51,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908360495] [2022-03-15 15:09:51,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:09:51,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 15:09:51,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 15:09:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 15:09:51,933 INFO L87 Difference]: Start difference. First operand 8712 states and 17614 transitions. Second operand has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:56,853 INFO L93 Difference]: Finished difference Result 16123 states and 32198 transitions. [2022-03-15 15:09:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 15:09:56,853 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:09:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:56,871 INFO L225 Difference]: With dead ends: 16123 [2022-03-15 15:09:56,872 INFO L226 Difference]: Without dead ends: 16123 [2022-03-15 15:09:56,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 241 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2013, Invalid=11097, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 15:09:56,873 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 3324 mSDsluCounter, 5302 mSDsCounter, 0 mSdLazyCounter, 6724 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3324 SdHoareTripleChecker+Valid, 5727 SdHoareTripleChecker+Invalid, 7260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 6724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:56,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3324 Valid, 5727 Invalid, 7260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 6724 Invalid, 0 Unknown, 189 Unchecked, 2.6s Time] [2022-03-15 15:09:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16123 states. [2022-03-15 15:09:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16123 to 8900. [2022-03-15 15:09:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8900 states, 8887 states have (on average 2.024192640936199) internal successors, (17989), 8899 states have internal predecessors, (17989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8900 states to 8900 states and 17989 transitions. [2022-03-15 15:09:56,994 INFO L78 Accepts]: Start accepts. Automaton has 8900 states and 17989 transitions. Word has length 134 [2022-03-15 15:09:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:56,994 INFO L470 AbstractCegarLoop]: Abstraction has 8900 states and 17989 transitions. [2022-03-15 15:09:56,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 8900 states and 17989 transitions. [2022-03-15 15:09:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:09:56,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:56,997 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:57,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:57,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 15:09:57,198 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:09:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1965972689, now seen corresponding path program 1 times [2022-03-15 15:09:57,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:57,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788782914] [2022-03-15 15:09:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:57,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:57,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788782914] [2022-03-15 15:09:57,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788782914] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:57,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299876958] [2022-03-15 15:09:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:57,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:57,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:57,569 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:57,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 15:09:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:57,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 15:09:57,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:58,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:58,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:58,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:58,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:58,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 15:09:58,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:09:58,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:09:58,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:09:58,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:58,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2022-03-15 15:10:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:04,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:10:06,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (not (<= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|)) (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= 0 (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= 0 (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0))))) is different from false [2022-03-15 15:10:09,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0))))) is different from false [2022-03-15 15:10:27,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse2 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5)) 0))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post38#1| 1) |v_ULTIMATE.start_main_~i~2#1_22|)))) is different from false [2022-03-15 15:10:29,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (< |v_ULTIMATE.start_main_~i~2#1_22| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse2 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5)) 0))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))) is different from false [2022-03-15 15:10:31,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= 0 (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse4 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) .cse6 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_ULTIMATE.start_main_~i~2#1_22| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))) is different from false [2022-03-15 15:10:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 3 not checked. [2022-03-15 15:10:32,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299876958] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:10:32,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:10:32,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-03-15 15:10:32,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434338352] [2022-03-15 15:10:32,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:10:32,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 15:10:32,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:32,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 15:10:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1367, Unknown=13, NotChecked=400, Total=1980 [2022-03-15 15:10:32,472 INFO L87 Difference]: Start difference. First operand 8900 states and 17989 transitions. Second operand has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:42,325 WARN L228 SmtUtils]: Spent 9.44s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 15:10:43,150 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_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_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (< |v_ULTIMATE.start_main_~i~2#1_22| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse3 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))))) is different from false [2022-03-15 15:10:44,001 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (= |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| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= 0 (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse4 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) .cse6 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_ULTIMATE.start_main_~i~2#1_22| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|))))) is different from false [2022-03-15 15:10:46,639 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_main_#t~post38#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse3 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post38#1| 1) |v_ULTIMATE.start_main_~i~2#1_22|)))) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (<= 0 |c_ULTIMATE.start_main_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2022-03-15 15:10:48,666 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0))))) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0))) is different from false [2022-03-15 15:10:49,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (not (<= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|)) (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= 0 (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= 0 (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0))))) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0) (<= 1 (div |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| 28)))) is different from false [2022-03-15 15:11:35,778 WARN L228 SmtUtils]: Spent 11.73s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 15:12:39,930 WARN L228 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 15:12:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:40,255 INFO L93 Difference]: Finished difference Result 22695 states and 45669 transitions. [2022-03-15 15:12:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 15:12:40,255 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:12:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:40,287 INFO L225 Difference]: With dead ends: 22695 [2022-03-15 15:12:40,287 INFO L226 Difference]: Without dead ends: 22695 [2022-03-15 15:12:40,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 157.6s TimeCoverageRelationStatistics Valid=573, Invalid=3312, Unknown=61, NotChecked=1310, Total=5256 [2022-03-15 15:12:40,288 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 1007 mSDsluCounter, 4781 mSDsCounter, 0 mSdLazyCounter, 3738 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 5116 SdHoareTripleChecker+Invalid, 8370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4585 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:40,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 5116 Invalid, 8370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3738 Invalid, 0 Unknown, 4585 Unchecked, 2.0s Time] [2022-03-15 15:12:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22695 states. [2022-03-15 15:12:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22695 to 8927. [2022-03-15 15:12:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8927 states, 8914 states have (on average 2.0241193628000897) internal successors, (18043), 8926 states have internal predecessors, (18043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8927 states to 8927 states and 18043 transitions. [2022-03-15 15:12:40,449 INFO L78 Accepts]: Start accepts. Automaton has 8927 states and 18043 transitions. Word has length 134 [2022-03-15 15:12:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:40,450 INFO L470 AbstractCegarLoop]: Abstraction has 8927 states and 18043 transitions. [2022-03-15 15:12:40,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8927 states and 18043 transitions. [2022-03-15 15:12:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:12:40,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:40,453 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:40,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-15 15:12:40,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 15:12:40,654 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-15 15:12:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash 154946487, now seen corresponding path program 2 times [2022-03-15 15:12:40,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:40,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249355288] [2022-03-15 15:12:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:41,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:41,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249355288] [2022-03-15 15:12:41,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249355288] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:12:41,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307902074] [2022-03-15 15:12:41,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:12:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:41,103 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:12:41,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 15:12:41,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 15:12:41,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:12:41,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 15:12:41,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:12:41,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:12:42,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:12:42,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:12:42,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-03-15 15:12:42,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:12:42,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:12:42,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:12:42,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 80 [2022-03-15 15:12:42,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:42,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 103 [2022-03-15 15:12:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:46,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:12:51,331 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_5365 Int) (v_ArrVal_5363 Int)) (let ((.cse2 (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)) (.cse1 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (let ((.cse0 (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) .cse2 v_ArrVal_5363) .cse1 v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (and (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_5371 Int)) (= (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse11 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse11)) 0))) (not (<= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)))))) is different from false [2022-03-15 15:12:53,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_5365 Int) (v_ArrVal_5363 Int)) (let ((.cse2 (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)) (.cse1 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (let ((.cse0 (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse2 v_ArrVal_5363) .cse1 v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))) (or (not (= (select .cse0 .cse1) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (not (= (select .cse0 .cse2) 0)) (and (forall ((v_ArrVal_5371 Int)) (= (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (select .cse8 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0))))))) is different from false [2022-03-15 15:13:16,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_24| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post38#1| 1) |v_ULTIMATE.start_main_~i~2#1_24|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_5365 Int) (v_ArrVal_5363 Int)) (let ((.cse16 (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)) (.cse1 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (let ((.cse0 (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)) |c_~#cache~0.base|) .cse16 v_ArrVal_5363) .cse1 v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))) (or (not (= (select .cse0 .cse1) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ (* |v_ULTIMATE.start_main_~i~2#1_24| 28) |c_~#cache~0.offset|)) (and (forall ((v_ArrVal_5371 Int)) (= (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (let ((.cse3 (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5371 Int)) (= (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0)))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse15 |c_~#cache~0.base| (store (store (store (select .cse15 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |c_~#cache~0.base| (store (select .cse13 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0))) (not (= (select .cse0 .cse16) 0)))))))) is different from false [2022-03-15 15:14:32,153 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-03-15 15:14:32,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 100956 treesize of output 100948 [2022-03-15 15:14:35,287 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 15:14:35,287 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 7614 treesize of output 7608 [2022-03-15 15:14:35,320 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 15:14:35,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-15 15:14:35,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-15 15:14:35,538 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 15:14:35,541 INFO L158 Benchmark]: Toolchain (without parser) took 376706.15ms. Allocated memory was 197.1MB in the beginning and 634.4MB in the end (delta: 437.3MB). Free memory was 138.6MB in the beginning and 457.0MB in the end (delta: -318.4MB). Peak memory consumption was 421.0MB. Max. memory is 8.0GB. [2022-03-15 15:14:35,541 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 15:14:35,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.14ms. Allocated memory was 197.1MB in the beginning and 262.1MB in the end (delta: 65.0MB). Free memory was 138.3MB in the beginning and 213.4MB in the end (delta: -75.0MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-03-15 15:14:35,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.65ms. Allocated memory is still 262.1MB. Free memory was 213.4MB in the beginning and 210.5MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 15:14:35,541 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 262.1MB. Free memory was 210.5MB in the beginning and 208.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 15:14:35,541 INFO L158 Benchmark]: RCFGBuilder took 384.49ms. Allocated memory is still 262.1MB. Free memory was 208.4MB in the beginning and 192.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 15:14:35,541 INFO L158 Benchmark]: TraceAbstraction took 375804.91ms. Allocated memory was 262.1MB in the beginning and 634.4MB in the end (delta: 372.2MB). Free memory was 192.0MB in the beginning and 457.0MB in the end (delta: -265.0MB). Peak memory consumption was 410.7MB. Max. memory is 8.0GB. [2022-03-15 15:14:35,542 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.14ms. Allocated memory was 197.1MB in the beginning and 262.1MB in the end (delta: 65.0MB). Free memory was 138.3MB in the beginning and 213.4MB in the end (delta: -75.0MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.65ms. Allocated memory is still 262.1MB. Free memory was 213.4MB in the beginning and 210.5MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 262.1MB. Free memory was 210.5MB in the beginning and 208.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 384.49ms. Allocated memory is still 262.1MB. Free memory was 208.4MB in the beginning and 192.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 375804.91ms. Allocated memory was 262.1MB in the beginning and 634.4MB in the end (delta: 372.2MB). Free memory was 192.0MB in the beginning and 457.0MB in the end (delta: -265.0MB). Peak memory consumption was 410.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 15:14:35,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...