/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_04-funloop_hard1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 18:21:32,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 18:21:32,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 18:21:32,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 18:21:32,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 18:21:32,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 18:21:32,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 18:21:32,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 18:21:32,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 18:21:32,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 18:21:32,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 18:21:32,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 18:21:32,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 18:21:32,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 18:21:32,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 18:21:32,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 18:21:32,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 18:21:32,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 18:21:32,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 18:21:32,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 18:21:32,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 18:21:32,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 18:21:32,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 18:21:32,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 18:21:32,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 18:21:32,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 18:21:32,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 18:21:32,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 18:21:32,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 18:21:32,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 18:21:32,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 18:21:32,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 18:21:32,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 18:21:32,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 18:21:32,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 18:21:32,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 18:21:32,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 18:21:32,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 18:21:32,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 18:21:32,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 18:21:32,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 18:21:32,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 18:21:32,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 18:21:32,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 18:21:32,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 18:21:32,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 18:21:32,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 18:21:32,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 18:21:32,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 18:21:32,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 18:21:32,759 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 18:21:32,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 18:21:32,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 18:21:32,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:21:32,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 18:21:32,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 18:21:32,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 18:21:32,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 18:21:32,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 18:21:32,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 18:21:32,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-03 18:21:32,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 18:21:32,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 18:21:32,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 18:21:32,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 18:21:32,978 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 18:21:32,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-03-03 18:21:33,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4050a29ab/c17589b12d774519a204da64e8ce0182/FLAG5914265cf [2022-03-03 18:21:33,437 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 18:21:33,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-03-03 18:21:33,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4050a29ab/c17589b12d774519a204da64e8ce0182/FLAG5914265cf [2022-03-03 18:21:33,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4050a29ab/c17589b12d774519a204da64e8ce0182 [2022-03-03 18:21:33,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 18:21:33,466 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 18:21:33,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 18:21:33,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 18:21:33,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 18:21:33,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:33,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278566c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33, skipping insertion in model container [2022-03-03 18:21:33,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:33,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 18:21:33,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 18:21:33,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:21:33,873 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 18:21:33,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:21:33,947 INFO L208 MainTranslator]: Completed translation [2022-03-03 18:21:33,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33 WrapperNode [2022-03-03 18:21:33,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 18:21:33,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 18:21:33,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 18:21:33,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 18:21:33,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:33,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,004 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-03-03 18:21:34,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 18:21:34,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 18:21:34,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 18:21:34,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 18:21:34,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 18:21:34,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 18:21:34,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 18:21:34,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 18:21:34,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (1/1) ... [2022-03-03 18:21:34,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:21:34,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:34,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 18:21:34,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 18:21:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 18:21:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 18:21:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 18:21:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 18:21:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 18:21:34,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 18:21:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-03 18:21:34,128 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-03 18:21:34,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 18:21:34,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 18:21:34,130 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 18:21:34,267 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 18:21:34,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 18:21:34,448 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 18:21:34,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 18:21:34,454 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 18:21:34,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:21:34 BoogieIcfgContainer [2022-03-03 18:21:34,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 18:21:34,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 18:21:34,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 18:21:34,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 18:21:34,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:21:33" (1/3) ... [2022-03-03 18:21:34,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:21:34, skipping insertion in model container [2022-03-03 18:21:34,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:33" (2/3) ... [2022-03-03 18:21:34,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:21:34, skipping insertion in model container [2022-03-03 18:21:34,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:21:34" (3/3) ... [2022-03-03 18:21:34,460 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2022-03-03 18:21:34,464 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 18:21:34,464 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 18:21:34,464 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-03 18:21:34,464 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 18:21:34,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,494 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,495 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:21:34,514 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 18:21:34,540 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 18:21:34,544 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 18:21:34,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-03 18:21:34,553 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 128 transitions, 261 flow [2022-03-03 18:21:34,627 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-03 18:21:34,633 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-03 18:21:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-03 18:21:34,645 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:34,645 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-03 18:21:34,646 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-03 18:21:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -88358338, now seen corresponding path program 1 times [2022-03-03 18:21:34,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:34,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200327783] [2022-03-03 18:21:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:34,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:34,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200327783] [2022-03-03 18:21:34,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200327783] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:34,887 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:34,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:21:34,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905215320] [2022-03-03 18:21:34,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:34,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 18:21:34,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:34,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 18:21:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 18:21:34,941 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-03 18:21:34,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:34,985 INFO L93 Difference]: Finished difference Result 2321 states and 4620 transitions. [2022-03-03 18:21:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 18:21:34,987 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-03 18:21:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:35,010 INFO L225 Difference]: With dead ends: 2321 [2022-03-03 18:21:35,010 INFO L226 Difference]: Without dead ends: 2321 [2022-03-03 18:21:35,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 18:21:35,014 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-03 18:21:35,014 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-03 18:21:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2022-03-03 18:21:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2022-03-03 18:21:35,097 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-03 18:21:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4620 transitions. [2022-03-03 18:21:35,103 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4620 transitions. Word has length 31 [2022-03-03 18:21:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:35,103 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 4620 transitions. [2022-03-03 18:21:35,103 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-03 18:21:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4620 transitions. [2022-03-03 18:21:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-03 18:21:35,145 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:35,145 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-03 18:21:35,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 18:21:35,147 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-03 18:21:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash -932830209, now seen corresponding path program 1 times [2022-03-03 18:21:35,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:35,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269072911] [2022-03-03 18:21:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:35,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:35,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269072911] [2022-03-03 18:21:35,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269072911] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:35,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:35,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 18:21:35,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753427996] [2022-03-03 18:21:35,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:35,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:35,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:21:35,276 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-03 18:21:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:35,328 INFO L93 Difference]: Finished difference Result 2325 states and 4624 transitions. [2022-03-03 18:21:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:35,329 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-03 18:21:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:35,336 INFO L225 Difference]: With dead ends: 2325 [2022-03-03 18:21:35,336 INFO L226 Difference]: Without dead ends: 2325 [2022-03-03 18:21:35,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:21:35,337 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-03 18:21:35,339 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-03 18:21:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-03-03 18:21:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2322. [2022-03-03 18:21:35,376 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-03 18:21:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4621 transitions. [2022-03-03 18:21:35,382 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 4621 transitions. Word has length 31 [2022-03-03 18:21:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:35,382 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 4621 transitions. [2022-03-03 18:21:35,383 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-03 18:21:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 4621 transitions. [2022-03-03 18:21:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-03 18:21:35,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:35,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:35,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 18:21:35,387 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-03 18:21:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash 527090186, now seen corresponding path program 1 times [2022-03-03 18:21:35,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:35,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411245767] [2022-03-03 18:21:35,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:35,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:35,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411245767] [2022-03-03 18:21:35,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411245767] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:35,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465319472] [2022-03-03 18:21:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:35,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:35,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:35,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:35,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-03 18:21:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:35,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-03 18:21:35,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:35,670 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-03 18:21:35,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:35,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465319472] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:35,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:35,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-03 18:21:35,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273718783] [2022-03-03 18:21:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:35,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:35,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:35,672 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-03 18:21:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:35,698 INFO L93 Difference]: Finished difference Result 3432 states and 6841 transitions. [2022-03-03 18:21:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:35,699 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-03 18:21:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:35,709 INFO L225 Difference]: With dead ends: 3432 [2022-03-03 18:21:35,709 INFO L226 Difference]: Without dead ends: 3432 [2022-03-03 18:21:35,710 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-03 18:21:35,710 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-03 18:21:35,711 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-03 18:21:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-03-03 18:21:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2359. [2022-03-03 18:21:35,749 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-03 18:21:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4695 transitions. [2022-03-03 18:21:35,755 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4695 transitions. Word has length 36 [2022-03-03 18:21:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:35,755 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 4695 transitions. [2022-03-03 18:21:35,755 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-03 18:21:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4695 transitions. [2022-03-03 18:21:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-03 18:21:35,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:35,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:35,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-03 18:21:35,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:35,971 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-03 18:21:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -877434549, now seen corresponding path program 1 times [2022-03-03 18:21:35,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:35,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229456581] [2022-03-03 18:21:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:36,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:36,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229456581] [2022-03-03 18:21:36,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229456581] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:36,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671484612] [2022-03-03 18:21:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:36,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:36,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:36,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:36,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-03 18:21:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:36,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 18:21:36,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:36,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:36,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671484612] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:36,376 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:36,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 18:21:36,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349959276] [2022-03-03 18:21:36,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:36,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:36,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:36,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:36,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 18:21:36,377 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-03 18:21:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:36,439 INFO L93 Difference]: Finished difference Result 2369 states and 4705 transitions. [2022-03-03 18:21:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:21:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-03-03 18:21:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:36,450 INFO L225 Difference]: With dead ends: 2369 [2022-03-03 18:21:36,450 INFO L226 Difference]: Without dead ends: 2369 [2022-03-03 18:21:36,450 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-03 18:21:36,451 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-03 18:21:36,451 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-03 18:21:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-03-03 18:21:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2022-03-03 18:21:36,480 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-03 18:21:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4705 transitions. [2022-03-03 18:21:36,485 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4705 transitions. Word has length 40 [2022-03-03 18:21:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:36,485 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 4705 transitions. [2022-03-03 18:21:36,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4705 transitions. [2022-03-03 18:21:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-03 18:21:36,486 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:36,486 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:36,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:36,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-03 18:21:36,703 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-03 18:21:36,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash -198306197, now seen corresponding path program 2 times [2022-03-03 18:21:36,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:36,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672865478] [2022-03-03 18:21:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:36,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:36,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672865478] [2022-03-03 18:21:36,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672865478] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:36,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662153611] [2022-03-03 18:21:36,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:36,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:36,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:36,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:36,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-03 18:21:36,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:36,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:36,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-03 18:21:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:36,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:21:36,915 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-03 18:21:36,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:21:36,944 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-03 18:21:36,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:21:36,984 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-03 18:21:36,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:21:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-03 18:21:37,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:37,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662153611] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:37,003 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:37,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-03 18:21:37,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952197509] [2022-03-03 18:21:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:37,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:37,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-03 18:21:37,004 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-03 18:21:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:37,156 INFO L93 Difference]: Finished difference Result 2638 states and 5243 transitions. [2022-03-03 18:21:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:37,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-03 18:21:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:37,164 INFO L225 Difference]: With dead ends: 2638 [2022-03-03 18:21:37,164 INFO L226 Difference]: Without dead ends: 2638 [2022-03-03 18:21:37,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-03 18:21:37,165 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.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:37,165 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.1s Time] [2022-03-03 18:21:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2022-03-03 18:21:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2502. [2022-03-03 18:21:37,223 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-03 18:21:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4971 transitions. [2022-03-03 18:21:37,228 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4971 transitions. Word has length 50 [2022-03-03 18:21:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:37,229 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 4971 transitions. [2022-03-03 18:21:37,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4971 transitions. [2022-03-03 18:21:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-03 18:21:37,229 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:37,230 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:37,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:37,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:37,445 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-03 18:21:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash 697598481, now seen corresponding path program 1 times [2022-03-03 18:21:37,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:37,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295360828] [2022-03-03 18:21:37,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:37,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:37,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295360828] [2022-03-03 18:21:37,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295360828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:37,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906527756] [2022-03-03 18:21:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:37,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:37,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:37,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:37,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-03 18:21:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:37,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 18:21:37,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:37,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:37,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906527756] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:37,815 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:37,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 18:21:37,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99595776] [2022-03-03 18:21:37,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:37,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 18:21:37,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:37,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 18:21:37,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:37,816 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-03 18:21:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:38,004 INFO L93 Difference]: Finished difference Result 2522 states and 4991 transitions. [2022-03-03 18:21:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:21:38,004 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-03 18:21:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:38,011 INFO L225 Difference]: With dead ends: 2522 [2022-03-03 18:21:38,011 INFO L226 Difference]: Without dead ends: 2522 [2022-03-03 18:21:38,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-03 18:21:38,012 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-03 18:21:38,013 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-03 18:21:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-03-03 18:21:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2022-03-03 18:21:38,076 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-03 18:21:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4991 transitions. [2022-03-03 18:21:38,102 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4991 transitions. Word has length 50 [2022-03-03 18:21:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:38,103 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4991 transitions. [2022-03-03 18:21:38,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4991 transitions. [2022-03-03 18:21:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-03 18:21:38,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:38,104 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:38,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:38,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:38,304 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-03 18:21:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1015929775, now seen corresponding path program 2 times [2022-03-03 18:21:38,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:38,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326606933] [2022-03-03 18:21:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:38,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:38,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326606933] [2022-03-03 18:21:38,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326606933] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:38,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957951610] [2022-03-03 18:21:38,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:38,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:38,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:38,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:38,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-03 18:21:38,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:38,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:38,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-03 18:21:38,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:38,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:21:38,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:21:38,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,728 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:21:38,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:21:38,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:38,769 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:21:38,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:21:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-03 18:21:38,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:38,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957951610] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:38,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:38,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-03 18:21:38,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864697705] [2022-03-03 18:21:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:38,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:38,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:21:38,797 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-03 18:21:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:39,389 INFO L93 Difference]: Finished difference Result 5451 states and 10849 transitions. [2022-03-03 18:21:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:21:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-03-03 18:21:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:39,406 INFO L225 Difference]: With dead ends: 5451 [2022-03-03 18:21:39,406 INFO L226 Difference]: Without dead ends: 5451 [2022-03-03 18:21:39,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 18:21:39,408 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:39,408 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.4s Time] [2022-03-03 18:21:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2022-03-03 18:21:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 3341. [2022-03-03 18:21:39,479 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-03 18:21:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 6629 transitions. [2022-03-03 18:21:39,486 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 6629 transitions. Word has length 70 [2022-03-03 18:21:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:39,486 INFO L470 AbstractCegarLoop]: Abstraction has 3341 states and 6629 transitions. [2022-03-03 18:21:39,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 6629 transitions. [2022-03-03 18:21:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-03 18:21:39,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:39,487 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:39,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-03 18:21:39,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:39,703 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-03 18:21:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -177478757, now seen corresponding path program 1 times [2022-03-03 18:21:39,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:39,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144191635] [2022-03-03 18:21:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:39,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:39,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144191635] [2022-03-03 18:21:39,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144191635] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:39,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852651796] [2022-03-03 18:21:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:39,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:39,861 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:39,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 18:21:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:39,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-03 18:21:39,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:40,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:21:40,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852651796] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:40,406 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:40,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-03 18:21:40,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716043765] [2022-03-03 18:21:40,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:40,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-03 18:21:40,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-03 18:21:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:40,407 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-03 18:21:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:40,751 INFO L93 Difference]: Finished difference Result 3356 states and 6644 transitions. [2022-03-03 18:21:40,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:21:40,763 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-03-03 18:21:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:40,769 INFO L225 Difference]: With dead ends: 3356 [2022-03-03 18:21:40,769 INFO L226 Difference]: Without dead ends: 3356 [2022-03-03 18:21:40,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:21:40,770 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 40 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:40,770 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.1s Time] [2022-03-03 18:21:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2022-03-03 18:21:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3356. [2022-03-03 18:21:40,841 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-03 18:21:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 6644 transitions. [2022-03-03 18:21:40,847 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 6644 transitions. Word has length 78 [2022-03-03 18:21:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:40,863 INFO L470 AbstractCegarLoop]: Abstraction has 3356 states and 6644 transitions. [2022-03-03 18:21:40,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 6644 transitions. [2022-03-03 18:21:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-03 18:21:40,864 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:40,865 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:40,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:41,080 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-03 18:21:41,081 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-03 18:21:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash 26007824, now seen corresponding path program 2 times [2022-03-03 18:21:41,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:41,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730242296] [2022-03-03 18:21:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:41,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:41,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730242296] [2022-03-03 18:21:41,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730242296] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:41,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:41,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:41,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320162926] [2022-03-03 18:21:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:41,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:41,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:41,216 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-03 18:21:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:41,382 INFO L93 Difference]: Finished difference Result 3594 states and 7120 transitions. [2022-03-03 18:21:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:41,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-03 18:21:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:41,388 INFO L225 Difference]: With dead ends: 3594 [2022-03-03 18:21:41,388 INFO L226 Difference]: Without dead ends: 3594 [2022-03-03 18:21:41,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:41,388 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.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:41,389 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.2s Time] [2022-03-03 18:21:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-03-03 18:21:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3480. [2022-03-03 18:21:41,450 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-03 18:21:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6892 transitions. [2022-03-03 18:21:41,472 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6892 transitions. Word has length 93 [2022-03-03 18:21:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:41,473 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 6892 transitions. [2022-03-03 18:21:41,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6892 transitions. [2022-03-03 18:21:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-03 18:21:41,474 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:41,474 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:41,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 18:21:41,474 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-03 18:21:41,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 360970443, now seen corresponding path program 1 times [2022-03-03 18:21:41,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:41,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775239947] [2022-03-03 18:21:41,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:41,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:41,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775239947] [2022-03-03 18:21:41,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775239947] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:41,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:41,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:41,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530423482] [2022-03-03 18:21:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:41,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:41,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:41,597 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-03 18:21:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:41,822 INFO L93 Difference]: Finished difference Result 3912 states and 7756 transitions. [2022-03-03 18:21:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:41,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-03 18:21:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:41,828 INFO L225 Difference]: With dead ends: 3912 [2022-03-03 18:21:41,828 INFO L226 Difference]: Without dead ends: 3912 [2022-03-03 18:21:41,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:41,828 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 194 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03 18:21:41,828 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-03 18:21:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2022-03-03 18:21:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3714. [2022-03-03 18:21:41,951 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-03 18:21:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 7360 transitions. [2022-03-03 18:21:41,957 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 7360 transitions. Word has length 93 [2022-03-03 18:21:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:41,958 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 7360 transitions. [2022-03-03 18:21:41,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 7360 transitions. [2022-03-03 18:21:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:41,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:41,963 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:41,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 18:21:41,964 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-03 18:21:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1199640953, now seen corresponding path program 1 times [2022-03-03 18:21:41,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:41,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248505929] [2022-03-03 18:21:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:41,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:42,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:42,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248505929] [2022-03-03 18:21:42,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248505929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:42,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053244645] [2022-03-03 18:21:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:42,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:42,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:42,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:42,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 18:21:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:42,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:42,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:42,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:42,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053244645] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:42,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:42,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:21:42,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515375373] [2022-03-03 18:21:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:42,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:42,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:21:42,732 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-03 18:21:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:43,161 INFO L93 Difference]: Finished difference Result 8247 states and 16407 transitions. [2022-03-03 18:21:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:21:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:43,176 INFO L225 Difference]: With dead ends: 8247 [2022-03-03 18:21:43,176 INFO L226 Difference]: Without dead ends: 8247 [2022-03-03 18:21:43,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 18:21:43,177 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-03 18:21:43,177 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-03 18:21:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2022-03-03 18:21:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 3900. [2022-03-03 18:21:43,274 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-03 18:21:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 7713 transitions. [2022-03-03 18:21:43,281 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 7713 transitions. Word has length 105 [2022-03-03 18:21:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:43,281 INFO L470 AbstractCegarLoop]: Abstraction has 3900 states and 7713 transitions. [2022-03-03 18:21:43,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 7713 transitions. [2022-03-03 18:21:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:43,283 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:43,283 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:43,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:43,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:43,500 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-03 18:21:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash -509932149, now seen corresponding path program 1 times [2022-03-03 18:21:43,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:43,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612982041] [2022-03-03 18:21:43,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:43,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:43,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:43,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612982041] [2022-03-03 18:21:43,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612982041] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:43,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57935020] [2022-03-03 18:21:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:43,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:43,711 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-03 18:21:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:43,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:43,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:43,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:44,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:44,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57935020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:44,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:44,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:21:44,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891076901] [2022-03-03 18:21:44,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:44,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:44,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:21:44,047 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-03 18:21:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:44,593 INFO L93 Difference]: Finished difference Result 9773 states and 19440 transitions. [2022-03-03 18:21:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:21:44,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:44,609 INFO L225 Difference]: With dead ends: 9773 [2022-03-03 18:21:44,609 INFO L226 Difference]: Without dead ends: 9773 [2022-03-03 18:21:44,610 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-03 18:21:44,610 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.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:44,610 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.3s Time] [2022-03-03 18:21:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2022-03-03 18:21:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 3903. [2022-03-03 18:21:44,699 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-03 18:21:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 7719 transitions. [2022-03-03 18:21:44,706 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 7719 transitions. Word has length 105 [2022-03-03 18:21:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:44,707 INFO L470 AbstractCegarLoop]: Abstraction has 3903 states and 7719 transitions. [2022-03-03 18:21:44,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 7719 transitions. [2022-03-03 18:21:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:44,711 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:44,711 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:44,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-03 18:21:44,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-03 18:21:44,928 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-03 18:21:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1481321675, now seen corresponding path program 2 times [2022-03-03 18:21:44,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:44,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770656699] [2022-03-03 18:21:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:45,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:45,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770656699] [2022-03-03 18:21:45,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770656699] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:45,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339253192] [2022-03-03 18:21:45,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:45,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:45,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:45,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:45,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-03 18:21:45,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:45,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:45,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:45,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:45,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:45,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:45,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339253192] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:45,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:45,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:21:45,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485643827] [2022-03-03 18:21:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:45,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:45,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:21:45,579 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-03 18:21:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:46,281 INFO L93 Difference]: Finished difference Result 10247 states and 20388 transitions. [2022-03-03 18:21:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:21:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:46,317 INFO L225 Difference]: With dead ends: 10247 [2022-03-03 18:21:46,317 INFO L226 Difference]: Without dead ends: 10247 [2022-03-03 18:21:46,318 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-03 18:21:46,318 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-03 18:21:46,318 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-03 18:21:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-03-03 18:21:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 3905. [2022-03-03 18:21:46,374 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-03 18:21:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 7723 transitions. [2022-03-03 18:21:46,379 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 7723 transitions. Word has length 105 [2022-03-03 18:21:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:46,379 INFO L470 AbstractCegarLoop]: Abstraction has 3905 states and 7723 transitions. [2022-03-03 18:21:46,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 7723 transitions. [2022-03-03 18:21:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:46,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:46,382 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:46,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-03 18:21:46,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-03 18:21:46,598 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-03 18:21:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash 428011595, now seen corresponding path program 3 times [2022-03-03 18:21:46,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:46,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90040453] [2022-03-03 18:21:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:46,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:46,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90040453] [2022-03-03 18:21:46,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90040453] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:46,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524619626] [2022-03-03 18:21:46,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:21:46,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:46,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:46,712 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:46,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-03 18:21:46,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:21:46,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:46,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:46,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:47,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:47,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:47,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524619626] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:47,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:47,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:21:47,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728379315] [2022-03-03 18:21:47,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:47,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:47,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:47,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:47,107 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-03 18:21:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:48,251 INFO L93 Difference]: Finished difference Result 9750 states and 19370 transitions. [2022-03-03 18:21:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:21:48,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:48,281 INFO L225 Difference]: With dead ends: 9750 [2022-03-03 18:21:48,282 INFO L226 Difference]: Without dead ends: 9750 [2022-03-03 18:21:48,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:21:48,283 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1415 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:48,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1415 Valid, 1522 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:21:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2022-03-03 18:21:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 3925. [2022-03-03 18:21:48,436 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-03 18:21:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 7744 transitions. [2022-03-03 18:21:48,442 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 7744 transitions. Word has length 105 [2022-03-03 18:21:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:48,442 INFO L470 AbstractCegarLoop]: Abstraction has 3925 states and 7744 transitions. [2022-03-03 18:21:48,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 7744 transitions. [2022-03-03 18:21:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:48,457 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:48,457 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:48,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:48,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-03 18:21:48,671 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-03 18:21:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2091661697, now seen corresponding path program 4 times [2022-03-03 18:21:48,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:48,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838632445] [2022-03-03 18:21:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:49,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:49,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838632445] [2022-03-03 18:21:49,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838632445] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:49,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789222236] [2022-03-03 18:21:49,051 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:21:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:49,053 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:49,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-03 18:21:49,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:21:49,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:49,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:49,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:49,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:49,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:49,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789222236] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:49,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:49,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:49,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892964430] [2022-03-03 18:21:49,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:49,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:49,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:49,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:49,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:49,530 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-03 18:21:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:51,010 INFO L93 Difference]: Finished difference Result 13148 states and 26142 transitions. [2022-03-03 18:21:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:21:51,010 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:51,044 INFO L225 Difference]: With dead ends: 13148 [2022-03-03 18:21:51,052 INFO L226 Difference]: Without dead ends: 13148 [2022-03-03 18:21:51,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=373, Invalid=1883, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 18:21:51,053 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 1482 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1936 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.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:51,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1482 Valid, 1936 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:21:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13148 states. [2022-03-03 18:21:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13148 to 3975. [2022-03-03 18:21:51,254 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-03 18:21:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-03 18:21:51,260 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-03 18:21:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:51,260 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-03 18:21:51,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-03 18:21:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:51,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:51,262 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:51,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:51,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-03 18:21:51,480 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-03 18:21:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1656374657, now seen corresponding path program 5 times [2022-03-03 18:21:51,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:51,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509674382] [2022-03-03 18:21:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:51,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:51,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:51,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509674382] [2022-03-03 18:21:51,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509674382] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:51,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075940900] [2022-03-03 18:21:51,789 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:21:51,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:51,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:51,813 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:51,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-03 18:21:51,952 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:21:51,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:51,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:52,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:52,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:52,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075940900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:52,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:52,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:52,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083533683] [2022-03-03 18:21:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:52,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:52,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:52,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:52,316 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-03 18:21:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:53,286 INFO L93 Difference]: Finished difference Result 12864 states and 25565 transitions. [2022-03-03 18:21:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:21:53,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:53,301 INFO L225 Difference]: With dead ends: 12864 [2022-03-03 18:21:53,302 INFO L226 Difference]: Without dead ends: 12864 [2022-03-03 18:21:53,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 18:21:53,302 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 1063 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:53,303 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.5s Time] [2022-03-03 18:21:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2022-03-03 18:21:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 3977. [2022-03-03 18:21:53,384 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-03 18:21:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 7848 transitions. [2022-03-03 18:21:53,389 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 7848 transitions. Word has length 105 [2022-03-03 18:21:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:53,390 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 7848 transitions. [2022-03-03 18:21:53,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 7848 transitions. [2022-03-03 18:21:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:53,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:53,392 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:53,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:53,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-03 18:21:53,607 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-03 18:21:53,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1169892031, now seen corresponding path program 6 times [2022-03-03 18:21:53,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:53,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222020344] [2022-03-03 18:21:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:53,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:53,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222020344] [2022-03-03 18:21:53,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222020344] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:53,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644884144] [2022-03-03 18:21:53,845 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:21:53,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:53,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:53,846 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:53,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-03 18:21:53,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:21:53,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:53,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:53,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:54,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:54,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:54,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644884144] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:54,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:54,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:54,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244246324] [2022-03-03 18:21:54,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:54,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:54,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:54,293 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-03 18:21:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:55,530 INFO L93 Difference]: Finished difference Result 13826 states and 27441 transitions. [2022-03-03 18:21:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:21:55,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:55,550 INFO L225 Difference]: With dead ends: 13826 [2022-03-03 18:21:55,550 INFO L226 Difference]: Without dead ends: 13826 [2022-03-03 18:21:55,551 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-03 18:21:55,551 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-03 18:21:55,551 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-03 18:21:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-03-03 18:21:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 3975. [2022-03-03 18:21:55,632 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-03 18:21:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-03 18:21:55,636 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-03 18:21:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:55,637 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-03 18:21:55,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-03 18:21:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:55,638 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:55,638 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:55,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:55,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-03 18:21:55,855 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-03 18:21:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1363632863, now seen corresponding path program 7 times [2022-03-03 18:21:55,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:55,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834503046] [2022-03-03 18:21:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:56,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:56,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834503046] [2022-03-03 18:21:56,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834503046] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:56,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415769303] [2022-03-03 18:21:56,102 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:21:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:56,109 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:56,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-03 18:21:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:56,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:56,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:56,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:56,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:56,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415769303] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:56,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:56,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:56,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237615110] [2022-03-03 18:21:56,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:56,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:56,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:56,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:56,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:56,536 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-03 18:21:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:57,045 INFO L93 Difference]: Finished difference Result 11072 states and 21976 transitions. [2022-03-03 18:21:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:21:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:57,056 INFO L225 Difference]: With dead ends: 11072 [2022-03-03 18:21:57,057 INFO L226 Difference]: Without dead ends: 11072 [2022-03-03 18:21:57,057 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-03 18:21:57,058 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:57,058 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.4s Time] [2022-03-03 18:21:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2022-03-03 18:21:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 3978. [2022-03-03 18:21:57,115 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-03 18:21:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 7850 transitions. [2022-03-03 18:21:57,120 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 7850 transitions. Word has length 105 [2022-03-03 18:21:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:57,120 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 7850 transitions. [2022-03-03 18:21:57,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 7850 transitions. [2022-03-03 18:21:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:57,122 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:57,122 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:57,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:57,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:57,339 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-03 18:21:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash -61562595, now seen corresponding path program 8 times [2022-03-03 18:21:57,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:57,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888730036] [2022-03-03 18:21:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:57,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:57,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888730036] [2022-03-03 18:21:57,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888730036] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:57,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283889666] [2022-03-03 18:21:57,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:57,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:57,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:57,598 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:57,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-03 18:21:57,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:57,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:57,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:57,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:57,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:58,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:58,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283889666] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:58,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:58,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:58,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158704987] [2022-03-03 18:21:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:58,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:58,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:58,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:58,044 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-03 18:21:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:58,722 INFO L93 Difference]: Finished difference Result 12770 states and 25348 transitions. [2022-03-03 18:21:58,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:21:58,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:58,773 INFO L225 Difference]: With dead ends: 12770 [2022-03-03 18:21:58,773 INFO L226 Difference]: Without dead ends: 12770 [2022-03-03 18:21:58,774 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-03 18:21:58,774 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:58,774 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.4s Time] [2022-03-03 18:21:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2022-03-03 18:21:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 3980. [2022-03-03 18:21:58,827 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-03 18:21:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 7854 transitions. [2022-03-03 18:21:58,834 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 7854 transitions. Word has length 105 [2022-03-03 18:21:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:58,834 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 7854 transitions. [2022-03-03 18:21:58,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 7854 transitions. [2022-03-03 18:21:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:58,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:58,837 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:58,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:59,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:59,051 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-03 18:21:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1114872675, now seen corresponding path program 9 times [2022-03-03 18:21:59,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:59,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488021169] [2022-03-03 18:21:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:59,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:59,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488021169] [2022-03-03 18:21:59,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488021169] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:59,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537703555] [2022-03-03 18:21:59,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:21:59,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:59,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:59,269 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:21:59,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-03 18:21:59,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:21:59,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:59,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:59,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:59,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-03 18:21:59,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:59,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537703555] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:59,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:59,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:21:59,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583525983] [2022-03-03 18:21:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:59,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:59,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:59,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:21:59,695 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-03 18:22:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:00,546 INFO L93 Difference]: Finished difference Result 12273 states and 24330 transitions. [2022-03-03 18:22:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:00,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:00,563 INFO L225 Difference]: With dead ends: 12273 [2022-03-03 18:22:00,563 INFO L226 Difference]: Without dead ends: 12273 [2022-03-03 18:22:00,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:22:00,565 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 1214 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:00,565 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.5s Time] [2022-03-03 18:22:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2022-03-03 18:22:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 3975. [2022-03-03 18:22:00,661 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-03 18:22:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-03 18:22:00,669 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-03 18:22:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:00,669 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-03 18:22:00,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-03 18:22:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-03 18:22:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:00,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:00,680 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:00,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-03 18:22:00,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:00,896 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-03 18:22:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1959628071, now seen corresponding path program 10 times [2022-03-03 18:22:00,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:00,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779823200] [2022-03-03 18:22:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:01,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:01,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779823200] [2022-03-03 18:22:01,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779823200] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:01,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626691472] [2022-03-03 18:22:01,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:01,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:01,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:01,208 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:01,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-03 18:22:01,371 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:01,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:01,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:01,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:01,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:01,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:01,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626691472] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:01,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:01,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-03 18:22:01,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751766090] [2022-03-03 18:22:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:01,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:01,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:01,595 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-03 18:22:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:02,114 INFO L93 Difference]: Finished difference Result 9102 states and 18079 transitions. [2022-03-03 18:22:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:22:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:02,127 INFO L225 Difference]: With dead ends: 9102 [2022-03-03 18:22:02,127 INFO L226 Difference]: Without dead ends: 9102 [2022-03-03 18:22:02,128 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-03 18:22:02,129 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.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:02,129 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.3s Time] [2022-03-03 18:22:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2022-03-03 18:22:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 4050. [2022-03-03 18:22:02,183 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-03 18:22:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:02,187 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:02,188 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:02,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:02,189 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:02,189 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:02,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:02,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:02,404 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-03 18:22:02,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2128369343, now seen corresponding path program 11 times [2022-03-03 18:22:02,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:02,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345490035] [2022-03-03 18:22:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:02,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:02,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:02,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345490035] [2022-03-03 18:22:02,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345490035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:02,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816318385] [2022-03-03 18:22:02,713 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:02,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:02,728 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:02,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-03 18:22:02,896 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:02,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:02,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:02,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:03,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:03,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:03,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816318385] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:03,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:03,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:03,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92269561] [2022-03-03 18:22:03,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:03,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:03,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:03,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:03,248 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-03 18:22:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:04,323 INFO L93 Difference]: Finished difference Result 10156 states and 20144 transitions. [2022-03-03 18:22:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:04,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:04,335 INFO L225 Difference]: With dead ends: 10156 [2022-03-03 18:22:04,336 INFO L226 Difference]: Without dead ends: 10156 [2022-03-03 18:22:04,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:04,337 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1089 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1624 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.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:04,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1089 Valid, 1624 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:22:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2022-03-03 18:22:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 4050. [2022-03-03 18:22:04,394 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-03 18:22:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:04,399 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:04,399 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:04,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:04,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:04,401 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:04,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:04,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:04,618 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-03 18:22:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -16501203, now seen corresponding path program 12 times [2022-03-03 18:22:04,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:04,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380198484] [2022-03-03 18:22:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:04,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:04,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380198484] [2022-03-03 18:22:04,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380198484] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:04,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328031919] [2022-03-03 18:22:04,770 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:04,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:04,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:04,771 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:04,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-03 18:22:04,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:04,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:04,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:04,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:05,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:05,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-03 18:22:05,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:05,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328031919] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:05,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:05,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:05,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783316760] [2022-03-03 18:22:05,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:05,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:05,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:05,199 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-03 18:22:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:06,282 INFO L93 Difference]: Finished difference Result 14218 states and 28225 transitions. [2022-03-03 18:22:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:06,307 INFO L225 Difference]: With dead ends: 14218 [2022-03-03 18:22:06,307 INFO L226 Difference]: Without dead ends: 14218 [2022-03-03 18:22:06,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:06,308 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1402 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:06,308 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.6s Time] [2022-03-03 18:22:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2022-03-03 18:22:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 4054. [2022-03-03 18:22:06,427 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-03 18:22:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 8002 transitions. [2022-03-03 18:22:06,435 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 8002 transitions. Word has length 105 [2022-03-03 18:22:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:06,435 INFO L470 AbstractCegarLoop]: Abstraction has 4054 states and 8002 transitions. [2022-03-03 18:22:06,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 8002 transitions. [2022-03-03 18:22:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:06,438 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:06,448 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:06,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:06,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:06,667 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-03 18:22:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -563432145, now seen corresponding path program 13 times [2022-03-03 18:22:06,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:06,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809500314] [2022-03-03 18:22:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:06,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:06,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809500314] [2022-03-03 18:22:06,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809500314] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:06,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118567138] [2022-03-03 18:22:06,890 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:06,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:06,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:06,891 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:06,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-03 18:22:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:07,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:07,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:07,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:07,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:07,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118567138] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:07,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:07,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:07,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950605288] [2022-03-03 18:22:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:07,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:07,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:07,319 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-03 18:22:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:07,869 INFO L93 Difference]: Finished difference Result 9882 states and 19601 transitions. [2022-03-03 18:22:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:22:07,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:07,880 INFO L225 Difference]: With dead ends: 9882 [2022-03-03 18:22:07,880 INFO L226 Difference]: Without dead ends: 9882 [2022-03-03 18:22:07,880 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-03 18:22:07,881 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 856 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03 18:22:07,881 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-03 18:22:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9882 states. [2022-03-03 18:22:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9882 to 4056. [2022-03-03 18:22:07,958 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-03 18:22:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-03 18:22:07,962 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-03 18:22:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:07,962 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-03 18:22:07,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-03 18:22:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:07,964 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:07,964 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:07,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:08,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-03 18:22:08,181 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-03 18:22:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1049914771, now seen corresponding path program 14 times [2022-03-03 18:22:08,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:08,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627193050] [2022-03-03 18:22:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:08,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:08,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627193050] [2022-03-03 18:22:08,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627193050] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:08,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200147825] [2022-03-03 18:22:08,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:08,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:08,397 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:08,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-03 18:22:08,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:08,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:08,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:08,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:08,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:08,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:08,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200147825] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:08,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:08,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:08,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145091356] [2022-03-03 18:22:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:08,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:08,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:08,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:08,798 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-03 18:22:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:09,742 INFO L93 Difference]: Finished difference Result 10977 states and 21724 transitions. [2022-03-03 18:22:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:09,756 INFO L225 Difference]: With dead ends: 10977 [2022-03-03 18:22:09,756 INFO L226 Difference]: Without dead ends: 10977 [2022-03-03 18:22:09,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1456, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:09,757 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-03 18:22:09,757 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-03 18:22:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10977 states. [2022-03-03 18:22:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10977 to 4050. [2022-03-03 18:22:09,826 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-03 18:22:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:09,831 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:09,831 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:09,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:09,833 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:09,833 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:09,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-03 18:22:10,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-03 18:22:10,050 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-03 18:22:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash -550224723, now seen corresponding path program 15 times [2022-03-03 18:22:10,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:10,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963005657] [2022-03-03 18:22:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:10,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:10,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:10,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963005657] [2022-03-03 18:22:10,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963005657] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:10,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462104095] [2022-03-03 18:22:10,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:10,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:10,284 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:10,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-03 18:22:10,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:10,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:10,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:10,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:10,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:10,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:10,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462104095] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:10,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:10,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:10,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391914693] [2022-03-03 18:22:10,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:10,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:10,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:10,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:10,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:10,732 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-03 18:22:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:11,911 INFO L93 Difference]: Finished difference Result 12897 states and 25597 transitions. [2022-03-03 18:22:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:22:11,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:11,928 INFO L225 Difference]: With dead ends: 12897 [2022-03-03 18:22:11,928 INFO L226 Difference]: Without dead ends: 12897 [2022-03-03 18:22:11,928 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-03 18:22:11,929 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-03 18:22:11,929 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-03 18:22:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2022-03-03 18:22:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 4060. [2022-03-03 18:22:11,996 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-03 18:22:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 8014 transitions. [2022-03-03 18:22:12,000 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 8014 transitions. Word has length 105 [2022-03-03 18:22:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:12,000 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 8014 transitions. [2022-03-03 18:22:12,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 8014 transitions. [2022-03-03 18:22:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:12,002 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:12,002 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:12,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-03 18:22:12,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-03 18:22:12,219 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-03 18:22:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1097155665, now seen corresponding path program 16 times [2022-03-03 18:22:12,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:12,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921836734] [2022-03-03 18:22:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:12,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:12,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:12,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921836734] [2022-03-03 18:22:12,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921836734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:12,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286388157] [2022-03-03 18:22:12,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:12,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:12,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:12,423 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:12,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-03 18:22:12,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:12,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:12,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:12,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:12,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:12,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:12,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286388157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:12,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:12,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2022-03-03 18:22:12,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391718779] [2022-03-03 18:22:12,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:12,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:12,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:12,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:12,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:22:12,867 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-03 18:22:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:13,690 INFO L93 Difference]: Finished difference Result 16275 states and 32325 transitions. [2022-03-03 18:22:13,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:22:13,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:13,711 INFO L225 Difference]: With dead ends: 16275 [2022-03-03 18:22:13,712 INFO L226 Difference]: Without dead ends: 16275 [2022-03-03 18:22:13,712 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-03 18:22:13,712 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 1363 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:13,713 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.5s Time] [2022-03-03 18:22:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2022-03-03 18:22:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 4062. [2022-03-03 18:22:13,800 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-03 18:22:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 8018 transitions. [2022-03-03 18:22:13,804 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 8018 transitions. Word has length 105 [2022-03-03 18:22:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:13,805 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 8018 transitions. [2022-03-03 18:22:13,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 8018 transitions. [2022-03-03 18:22:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:13,806 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:13,806 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:13,825 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-03 18:22:14,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:14,024 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-03 18:22:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1583638291, now seen corresponding path program 17 times [2022-03-03 18:22:14,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:14,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890181589] [2022-03-03 18:22:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:14,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:14,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890181589] [2022-03-03 18:22:14,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890181589] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:14,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959490724] [2022-03-03 18:22:14,229 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:14,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:14,231 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:14,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-03 18:22:14,387 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:14,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:14,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:14,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:14,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:14,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-03 18:22:14,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:14,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959490724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:14,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:14,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:14,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094185681] [2022-03-03 18:22:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:14,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:14,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:14,690 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-03 18:22:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:15,949 INFO L93 Difference]: Finished difference Result 13575 states and 26896 transitions. [2022-03-03 18:22:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:15,969 INFO L225 Difference]: With dead ends: 13575 [2022-03-03 18:22:15,969 INFO L226 Difference]: Without dead ends: 13575 [2022-03-03 18:22:15,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2022-03-03 18:22:15,970 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 1337 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:15,970 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.7s Time] [2022-03-03 18:22:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2022-03-03 18:22:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 4056. [2022-03-03 18:22:16,046 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-03 18:22:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-03 18:22:16,051 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-03 18:22:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:16,051 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-03 18:22:16,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-03 18:22:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:16,053 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:16,053 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:16,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:16,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-03 18:22:16,268 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-03 18:22:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1389897459, now seen corresponding path program 18 times [2022-03-03 18:22:16,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:16,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983997411] [2022-03-03 18:22:16,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:16,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-03 18:22:16,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:16,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983997411] [2022-03-03 18:22:16,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983997411] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:16,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420428930] [2022-03-03 18:22:16,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:16,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:16,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:16,420 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:16,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-03 18:22:16,563 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:16,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:16,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:16,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:16,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:16,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:16,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420428930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:16,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:16,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:16,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839205176] [2022-03-03 18:22:16,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:16,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:16,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:16,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:16,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:16,835 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-03 18:22:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:17,131 INFO L93 Difference]: Finished difference Result 8414 states and 16665 transitions. [2022-03-03 18:22:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:17,141 INFO L225 Difference]: With dead ends: 8414 [2022-03-03 18:22:17,141 INFO L226 Difference]: Without dead ends: 8414 [2022-03-03 18:22:17,141 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-03 18:22:17,142 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.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:17,142 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.2s Time] [2022-03-03 18:22:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2022-03-03 18:22:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 4059. [2022-03-03 18:22:17,194 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-03 18:22:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 8012 transitions. [2022-03-03 18:22:17,199 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 8012 transitions. Word has length 105 [2022-03-03 18:22:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:17,199 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 8012 transitions. [2022-03-03 18:22:17,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 8012 transitions. [2022-03-03 18:22:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:17,201 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:17,201 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:17,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:17,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-03 18:22:17,418 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-03 18:22:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1479874379, now seen corresponding path program 19 times [2022-03-03 18:22:17,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:17,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064913384] [2022-03-03 18:22:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:17,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:17,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064913384] [2022-03-03 18:22:17,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064913384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:17,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442754148] [2022-03-03 18:22:17,631 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:17,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:17,633 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:17,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-03 18:22:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:17,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:17,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:18,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:18,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:18,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442754148] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:18,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:18,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:18,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53457613] [2022-03-03 18:22:18,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:18,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:18,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:18,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:18,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:18,099 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-03 18:22:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:18,779 INFO L93 Difference]: Finished difference Result 10112 states and 20037 transitions. [2022-03-03 18:22:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:22:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:18,791 INFO L225 Difference]: With dead ends: 10112 [2022-03-03 18:22:18,791 INFO L226 Difference]: Without dead ends: 10112 [2022-03-03 18:22:18,792 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-03 18:22:18,793 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 821 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03 18:22:18,793 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-03 18:22:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2022-03-03 18:22:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 4061. [2022-03-03 18:22:18,851 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-03 18:22:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 8016 transitions. [2022-03-03 18:22:18,855 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 8016 transitions. Word has length 105 [2022-03-03 18:22:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:18,856 INFO L470 AbstractCegarLoop]: Abstraction has 4061 states and 8016 transitions. [2022-03-03 18:22:18,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 8016 transitions. [2022-03-03 18:22:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:18,857 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:18,857 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:18,886 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-03 18:22:19,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:19,074 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-03 18:22:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash 426564299, now seen corresponding path program 20 times [2022-03-03 18:22:19,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:19,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386568515] [2022-03-03 18:22:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:19,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:19,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386568515] [2022-03-03 18:22:19,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386568515] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:19,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590593429] [2022-03-03 18:22:19,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:19,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:19,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:19,284 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:19,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-03 18:22:19,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:19,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:19,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:19,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:19,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:19,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:19,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590593429] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:19,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:19,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:19,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344244988] [2022-03-03 18:22:19,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:19,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:19,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:19,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:19,746 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-03 18:22:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:20,814 INFO L93 Difference]: Finished difference Result 9615 states and 19019 transitions. [2022-03-03 18:22:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:20,827 INFO L225 Difference]: With dead ends: 9615 [2022-03-03 18:22:20,827 INFO L226 Difference]: Without dead ends: 9615 [2022-03-03 18:22:20,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:20,828 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-03 18:22:20,828 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-03 18:22:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2022-03-03 18:22:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 4050. [2022-03-03 18:22:20,918 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-03 18:22:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:20,922 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:20,923 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:20,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:20,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:20,924 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:20,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:21,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:21,138 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-03 18:22:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2124234257, now seen corresponding path program 21 times [2022-03-03 18:22:21,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:21,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910182830] [2022-03-03 18:22:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:21,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:21,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910182830] [2022-03-03 18:22:21,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910182830] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:21,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943963488] [2022-03-03 18:22:21,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:21,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:21,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:21,319 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:21,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-03 18:22:21,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:21,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:21,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:21,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:21,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:21,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-03 18:22:21,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:21,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943963488] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:21,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:21,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:21,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557205389] [2022-03-03 18:22:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:21,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:21,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:21,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:21,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:21,804 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-03 18:22:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:22,311 INFO L93 Difference]: Finished difference Result 7878 states and 15626 transitions. [2022-03-03 18:22:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:22,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:22,320 INFO L225 Difference]: With dead ends: 7878 [2022-03-03 18:22:22,320 INFO L226 Difference]: Without dead ends: 7878 [2022-03-03 18:22:22,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:22,325 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-03 18:22:22,325 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-03 18:22:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-03-03 18:22:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4086. [2022-03-03 18:22:22,379 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-03 18:22:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-03 18:22:22,383 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-03 18:22:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:22,384 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-03 18:22:22,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-03 18:22:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:22,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:22,385 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:22,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-03 18:22:22,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:22,600 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-03 18:22:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1798897081, now seen corresponding path program 22 times [2022-03-03 18:22:22,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:22,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423164882] [2022-03-03 18:22:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:22,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:22,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423164882] [2022-03-03 18:22:22,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423164882] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:22,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974693329] [2022-03-03 18:22:22,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:22,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:22,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:22,856 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:22,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-03 18:22:23,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:23,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:23,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:23,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:23,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:23,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:23,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974693329] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:23,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:23,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-03 18:22:23,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811288539] [2022-03-03 18:22:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:23,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:23,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:23,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:23,253 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-03 18:22:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:23,919 INFO L93 Difference]: Finished difference Result 9039 states and 17934 transitions. [2022-03-03 18:22:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:22:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:23,929 INFO L225 Difference]: With dead ends: 9039 [2022-03-03 18:22:23,929 INFO L226 Difference]: Without dead ends: 9039 [2022-03-03 18:22:23,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:22:23,930 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 1028 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:23,930 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.5s Time] [2022-03-03 18:22:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2022-03-03 18:22:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 4089. [2022-03-03 18:22:23,979 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-03 18:22:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 8072 transitions. [2022-03-03 18:22:23,984 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 8072 transitions. Word has length 105 [2022-03-03 18:22:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:23,984 INFO L470 AbstractCegarLoop]: Abstraction has 4089 states and 8072 transitions. [2022-03-03 18:22:23,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 8072 transitions. [2022-03-03 18:22:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:23,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:23,986 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:24,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:24,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:24,203 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-03 18:22:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2005866963, now seen corresponding path program 23 times [2022-03-03 18:22:24,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:24,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226500530] [2022-03-03 18:22:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:24,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:24,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226500530] [2022-03-03 18:22:24,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226500530] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:24,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677755763] [2022-03-03 18:22:24,484 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:24,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:24,500 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:24,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-03 18:22:24,684 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:24,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:24,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:24,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:24,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:25,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:25,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677755763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:25,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:25,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:25,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275253513] [2022-03-03 18:22:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:25,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:25,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:25,017 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-03 18:22:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:26,284 INFO L93 Difference]: Finished difference Result 9474 states and 18775 transitions. [2022-03-03 18:22:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:26,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:26,295 INFO L225 Difference]: With dead ends: 9474 [2022-03-03 18:22:26,295 INFO L226 Difference]: Without dead ends: 9474 [2022-03-03 18:22:26,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1876, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 18:22:26,296 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-03 18:22:26,296 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-03 18:22:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states. [2022-03-03 18:22:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 4086. [2022-03-03 18:22:26,345 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-03 18:22:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-03 18:22:26,349 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-03 18:22:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:26,349 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-03 18:22:26,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-03 18:22:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-03 18:22:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:26,351 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:26,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-03 18:22:26,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:26,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-03 18:22:26,568 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-03 18:22:26,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2128263501, now seen corresponding path program 24 times [2022-03-03 18:22:26,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:26,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659586193] [2022-03-03 18:22:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:26,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:26,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659586193] [2022-03-03 18:22:26,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659586193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:26,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101511981] [2022-03-03 18:22:26,782 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:26,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:26,788 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:26,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-03 18:22:26,960 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:26,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:26,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:26,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:27,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:27,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:27,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101511981] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:27,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:27,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:27,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324239015] [2022-03-03 18:22:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:27,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:27,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:27,300 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-03 18:22:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:27,814 INFO L93 Difference]: Finished difference Result 8122 states and 16081 transitions. [2022-03-03 18:22:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:22:27,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:27,823 INFO L225 Difference]: With dead ends: 8122 [2022-03-03 18:22:27,823 INFO L226 Difference]: Without dead ends: 8122 [2022-03-03 18:22:27,824 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-03 18:22:27,824 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-03 18:22:27,824 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-03 18:22:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2022-03-03 18:22:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4095. [2022-03-03 18:22:27,869 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-03 18:22:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 8084 transitions. [2022-03-03 18:22:27,874 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 8084 transitions. Word has length 105 [2022-03-03 18:22:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:27,874 INFO L470 AbstractCegarLoop]: Abstraction has 4095 states and 8084 transitions. [2022-03-03 18:22:27,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 8084 transitions. [2022-03-03 18:22:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:27,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:27,876 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:27,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:28,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:28,092 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-03 18:22:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1959733913, now seen corresponding path program 25 times [2022-03-03 18:22:28,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:28,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882857297] [2022-03-03 18:22:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:28,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:28,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882857297] [2022-03-03 18:22:28,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882857297] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:28,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144070230] [2022-03-03 18:22:28,210 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:28,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:28,211 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:28,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-03 18:22:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:28,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:28,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:28,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-03 18:22:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:28,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:28,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144070230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:28,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:28,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:28,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514682434] [2022-03-03 18:22:28,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:28,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:28,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:28,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:28,695 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-03 18:22:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:29,718 INFO L93 Difference]: Finished difference Result 11081 states and 21956 transitions. [2022-03-03 18:22:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:29,731 INFO L225 Difference]: With dead ends: 11081 [2022-03-03 18:22:29,732 INFO L226 Difference]: Without dead ends: 11081 [2022-03-03 18:22:29,732 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-03 18:22:29,738 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-03 18:22:29,738 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-03 18:22:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11081 states. [2022-03-03 18:22:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11081 to 4092. [2022-03-03 18:22:29,796 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-03 18:22:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-03 18:22:29,802 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-03 18:22:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:29,802 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-03 18:22:29,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-03 18:22:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:29,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:29,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-03 18:22:29,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:30,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:30,020 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-03 18:22:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash -185136633, now seen corresponding path program 26 times [2022-03-03 18:22:30,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:30,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492924139] [2022-03-03 18:22:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:30,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:30,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:30,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492924139] [2022-03-03 18:22:30,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492924139] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:30,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88309068] [2022-03-03 18:22:30,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:30,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:30,143 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:30,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-03 18:22:30,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:30,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:30,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:30,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:30,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:30,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:30,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88309068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:30,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:30,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:30,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831802964] [2022-03-03 18:22:30,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:30,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:30,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:30,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:30,660 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-03 18:22:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:31,862 INFO L93 Difference]: Finished difference Result 13372 states and 26547 transitions. [2022-03-03 18:22:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 18:22:31,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:31,879 INFO L225 Difference]: With dead ends: 13372 [2022-03-03 18:22:31,879 INFO L226 Difference]: Without dead ends: 13372 [2022-03-03 18:22:31,880 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-03 18:22:31,880 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-03 18:22:31,880 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-03 18:22:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2022-03-03 18:22:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 4096. [2022-03-03 18:22:31,945 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-03 18:22:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 8086 transitions. [2022-03-03 18:22:31,949 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 8086 transitions. Word has length 105 [2022-03-03 18:22:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:31,949 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 8086 transitions. [2022-03-03 18:22:31,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 8086 transitions. [2022-03-03 18:22:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:31,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:31,951 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:31,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:32,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-03 18:22:32,168 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-03 18:22:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -732067575, now seen corresponding path program 27 times [2022-03-03 18:22:32,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:32,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150333303] [2022-03-03 18:22:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:32,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:32,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150333303] [2022-03-03 18:22:32,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150333303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:32,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996847849] [2022-03-03 18:22:32,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:32,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:32,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:32,378 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:32,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-03 18:22:32,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:32,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:32,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:32,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:32,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:32,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:32,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996847849] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:32,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:32,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:32,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329947720] [2022-03-03 18:22:32,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:32,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:32,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:32,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:32,873 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-03 18:22:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:33,624 INFO L93 Difference]: Finished difference Result 9134 states and 18105 transitions. [2022-03-03 18:22:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:22:33,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:33,635 INFO L225 Difference]: With dead ends: 9134 [2022-03-03 18:22:33,636 INFO L226 Difference]: Without dead ends: 9134 [2022-03-03 18:22:33,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 18:22:33,636 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1087 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03 18:22:33,636 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-03 18:22:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9134 states. [2022-03-03 18:22:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9134 to 4098. [2022-03-03 18:22:33,684 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-03 18:22:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8090 transitions. [2022-03-03 18:22:33,689 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8090 transitions. Word has length 105 [2022-03-03 18:22:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:33,689 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 8090 transitions. [2022-03-03 18:22:33,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-03 18:22:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8090 transitions. [2022-03-03 18:22:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:33,690 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:33,690 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:33,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:33,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-03 18:22:33,907 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-03 18:22:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1218550201, now seen corresponding path program 28 times [2022-03-03 18:22:33,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:33,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323623852] [2022-03-03 18:22:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:34,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:34,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323623852] [2022-03-03 18:22:34,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323623852] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:34,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684093051] [2022-03-03 18:22:34,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:34,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:34,007 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:34,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-03 18:22:34,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:34,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:34,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:34,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:34,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:34,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:34,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684093051] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:34,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:34,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-03 18:22:34,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523868426] [2022-03-03 18:22:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:34,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:34,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:22:34,403 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-03 18:22:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:35,524 INFO L93 Difference]: Finished difference Result 12493 states and 24756 transitions. [2022-03-03 18:22:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-03 18:22:35,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:35,540 INFO L225 Difference]: With dead ends: 12493 [2022-03-03 18:22:35,540 INFO L226 Difference]: Without dead ends: 12493 [2022-03-03 18:22:35,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 18:22:35,541 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-03 18:22:35,541 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-03 18:22:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2022-03-03 18:22:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 4086. [2022-03-03 18:22:35,605 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-03 18:22:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-03 18:22:35,610 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-03 18:22:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:35,610 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-03 18:22:35,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-03 18:22:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:35,611 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:35,611 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:35,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:35,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-03 18:22:35,812 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-03 18:22:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1585962891, now seen corresponding path program 29 times [2022-03-03 18:22:35,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:35,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965366882] [2022-03-03 18:22:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:35,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:35,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965366882] [2022-03-03 18:22:35,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965366882] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:35,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065794742] [2022-03-03 18:22:35,981 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:35,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:35,996 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:36,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-03 18:22:36,302 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:36,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:36,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:36,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:36,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:36,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:36,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065794742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:36,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:36,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:36,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454311447] [2022-03-03 18:22:36,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:36,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:36,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:36,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:36,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:36,593 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-03 18:22:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:37,060 INFO L93 Difference]: Finished difference Result 7570 states and 14977 transitions. [2022-03-03 18:22:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:37,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:37,069 INFO L225 Difference]: With dead ends: 7570 [2022-03-03 18:22:37,069 INFO L226 Difference]: Without dead ends: 7570 [2022-03-03 18:22:37,070 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-03 18:22:37,070 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 611 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:37,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1626 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:22:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2022-03-03 18:22:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 4091. [2022-03-03 18:22:37,113 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-03 18:22:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-03 18:22:37,117 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-03 18:22:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:37,117 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-03 18:22:37,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-03 18:22:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:37,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:37,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-03 18:22:37,136 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-03 18:22:37,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-03 18:22:37,331 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-03 18:22:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1792932773, now seen corresponding path program 30 times [2022-03-03 18:22:37,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:37,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727543537] [2022-03-03 18:22:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:37,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:37,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727543537] [2022-03-03 18:22:37,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727543537] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:37,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098438448] [2022-03-03 18:22:37,424 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:37,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:37,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:37,426 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:37,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-03 18:22:37,613 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:37,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:37,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:37,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:37,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:37,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:37,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098438448] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:37,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:37,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:37,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192994216] [2022-03-03 18:22:37,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:37,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:37,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:37,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:37,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:37,905 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-03 18:22:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:38,916 INFO L93 Difference]: Finished difference Result 10529 states and 20852 transitions. [2022-03-03 18:22:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:22:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:38,931 INFO L225 Difference]: With dead ends: 10529 [2022-03-03 18:22:38,932 INFO L226 Difference]: Without dead ends: 10529 [2022-03-03 18:22:38,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:22:38,932 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 1306 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 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.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:38,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1306 Valid, 1861 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:22:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2022-03-03 18:22:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 4088. [2022-03-03 18:22:38,995 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-03 18:22:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-03 18:22:38,999 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-03 18:22:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:38,999 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-03 18:22:38,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-03 18:22:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:39,001 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:39,001 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:39,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:39,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:39,213 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-03 18:22:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash 357163977, now seen corresponding path program 31 times [2022-03-03 18:22:39,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:39,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396476892] [2022-03-03 18:22:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:39,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:39,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396476892] [2022-03-03 18:22:39,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396476892] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:39,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366247073] [2022-03-03 18:22:39,446 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:39,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:39,447 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:39,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-03 18:22:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:39,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:39,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:39,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:39,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:39,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366247073] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:39,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:39,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:39,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19979900] [2022-03-03 18:22:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:39,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:39,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:39,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:39,953 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-03 18:22:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:41,214 INFO L93 Difference]: Finished difference Result 14591 states and 28933 transitions. [2022-03-03 18:22:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:41,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:41,234 INFO L225 Difference]: With dead ends: 14591 [2022-03-03 18:22:41,234 INFO L226 Difference]: Without dead ends: 14591 [2022-03-03 18:22:41,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 18:22:41,235 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 1598 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 2220 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.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:41,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1598 Valid, 2220 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:22:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2022-03-03 18:22:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 4092. [2022-03-03 18:22:41,314 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-03 18:22:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-03 18:22:41,319 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-03 18:22:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:41,319 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-03 18:22:41,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-03 18:22:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:41,320 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:41,320 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:41,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:41,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-03 18:22:41,537 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-03 18:22:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -189766965, now seen corresponding path program 32 times [2022-03-03 18:22:41,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:41,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044825955] [2022-03-03 18:22:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:41,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:41,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:41,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044825955] [2022-03-03 18:22:41,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044825955] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:41,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133265118] [2022-03-03 18:22:41,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:41,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:41,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:41,748 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:41,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-03 18:22:41,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:41,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:41,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:41,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:42,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:42,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:42,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133265118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:42,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:42,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:42,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541282723] [2022-03-03 18:22:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:42,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:42,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:42,273 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-03 18:22:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:42,923 INFO L93 Difference]: Finished difference Result 10255 states and 20309 transitions. [2022-03-03 18:22:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:22:42,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:42,934 INFO L225 Difference]: With dead ends: 10255 [2022-03-03 18:22:42,934 INFO L226 Difference]: Without dead ends: 10255 [2022-03-03 18:22:42,934 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-03 18:22:42,935 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1018 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 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-03 18:22:42,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 1835 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:22:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-03-03 18:22:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 4094. [2022-03-03 18:22:42,995 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-03 18:22:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-03 18:22:43,000 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-03 18:22:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:43,000 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-03 18:22:43,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-03 18:22:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:43,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:43,003 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:43,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-03-03 18:22:43,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-03 18:22:43,219 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-03 18:22:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash -676249591, now seen corresponding path program 33 times [2022-03-03 18:22:43,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:43,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7217033] [2022-03-03 18:22:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:43,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-03 18:22:43,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:43,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7217033] [2022-03-03 18:22:43,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7217033] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:43,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703152510] [2022-03-03 18:22:43,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:43,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:43,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:43,341 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:43,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-03 18:22:43,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:43,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:43,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:43,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:43,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:43,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:43,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703152510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:43,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:43,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:43,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774953537] [2022-03-03 18:22:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:43,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:43,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:43,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:43,845 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-03 18:22:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:44,835 INFO L93 Difference]: Finished difference Result 11350 states and 22432 transitions. [2022-03-03 18:22:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:22:44,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:44,849 INFO L225 Difference]: With dead ends: 11350 [2022-03-03 18:22:44,849 INFO L226 Difference]: Without dead ends: 11350 [2022-03-03 18:22:44,849 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-03 18:22:44,850 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1219 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 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-03 18:22:44,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 2165 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:22:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11350 states. [2022-03-03 18:22:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11350 to 4082. [2022-03-03 18:22:44,913 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-03 18:22:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 8058 transitions. [2022-03-03 18:22:44,918 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 8058 transitions. Word has length 105 [2022-03-03 18:22:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:44,918 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 8058 transitions. [2022-03-03 18:22:44,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 8058 transitions. [2022-03-03 18:22:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:44,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:44,920 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:44,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:45,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-03 18:22:45,151 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-03 18:22:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2113802281, now seen corresponding path program 34 times [2022-03-03 18:22:45,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:45,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994273922] [2022-03-03 18:22:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:45,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:45,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:45,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994273922] [2022-03-03 18:22:45,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994273922] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:45,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150303853] [2022-03-03 18:22:45,298 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:45,299 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:45,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-03 18:22:45,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:45,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:45,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:45,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:45,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:45,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:45,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150303853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:45,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:45,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-03 18:22:45,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719490732] [2022-03-03 18:22:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:45,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:45,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:45,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:22:45,741 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-03 18:22:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:46,756 INFO L93 Difference]: Finished difference Result 15159 states and 30102 transitions. [2022-03-03 18:22:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:22:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:46,774 INFO L225 Difference]: With dead ends: 15159 [2022-03-03 18:22:46,774 INFO L226 Difference]: Without dead ends: 15159 [2022-03-03 18:22:46,774 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-03 18:22:46,774 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 1559 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:46,775 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.7s Time] [2022-03-03 18:22:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2022-03-03 18:22:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 4092. [2022-03-03 18:22:46,844 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-03 18:22:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-03 18:22:46,848 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-03 18:22:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:46,848 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-03 18:22:46,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-03 18:22:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:46,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:46,850 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:46,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-03 18:22:47,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:47,065 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-03 18:22:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1566871339, now seen corresponding path program 35 times [2022-03-03 18:22:47,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:47,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875964617] [2022-03-03 18:22:47,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:47,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:47,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:47,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875964617] [2022-03-03 18:22:47,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875964617] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:47,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84096826] [2022-03-03 18:22:47,263 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:47,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:47,264 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:47,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-03 18:22:47,532 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:47,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:47,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:47,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:47,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:47,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:47,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84096826] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:47,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:47,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:47,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398432767] [2022-03-03 18:22:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:47,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:47,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:47,768 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-03 18:22:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:48,488 INFO L93 Difference]: Finished difference Result 12497 states and 24788 transitions. [2022-03-03 18:22:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:22:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:48,503 INFO L225 Difference]: With dead ends: 12497 [2022-03-03 18:22:48,504 INFO L226 Difference]: Without dead ends: 12497 [2022-03-03 18:22:48,504 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-03 18:22:48,504 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1045 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:48,505 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.5s Time] [2022-03-03 18:22:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-03-03 18:22:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 4094. [2022-03-03 18:22:48,598 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-03 18:22:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-03 18:22:48,603 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-03 18:22:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:48,603 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-03 18:22:48,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-03 18:22:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:48,605 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:48,605 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:48,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:48,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:48,820 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-03 18:22:48,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1080388713, now seen corresponding path program 36 times [2022-03-03 18:22:48,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:48,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716423210] [2022-03-03 18:22:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:49,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:49,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716423210] [2022-03-03 18:22:49,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716423210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:49,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229183904] [2022-03-03 18:22:49,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:49,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:49,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:49,029 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:49,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-03 18:22:49,265 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:49,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:49,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:49,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:49,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:49,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:49,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229183904] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:49,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:49,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:49,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811718339] [2022-03-03 18:22:49,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:49,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:49,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:49,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:49,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:49,532 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-03 18:22:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:50,529 INFO L93 Difference]: Finished difference Result 13459 states and 26664 transitions. [2022-03-03 18:22:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:22:50,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:50,547 INFO L225 Difference]: With dead ends: 13459 [2022-03-03 18:22:50,548 INFO L226 Difference]: Without dead ends: 13459 [2022-03-03 18:22:50,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:22:50,548 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-03 18:22:50,548 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-03 18:22:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2022-03-03 18:22:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 4088. [2022-03-03 18:22:50,619 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-03 18:22:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-03 18:22:50,623 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-03 18:22:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:50,623 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-03 18:22:50,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-03 18:22:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:50,625 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:50,625 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:50,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-03 18:22:50,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-03 18:22:50,835 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-03 18:22:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1274129545, now seen corresponding path program 37 times [2022-03-03 18:22:50,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:50,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282757345] [2022-03-03 18:22:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:50,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:50,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282757345] [2022-03-03 18:22:50,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282757345] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:50,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110994201] [2022-03-03 18:22:50,987 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:50,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:50,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:50,988 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:50,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-03 18:22:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:51,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:51,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:51,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:51,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:51,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110994201] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:51,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:51,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:51,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732966728] [2022-03-03 18:22:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:51,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:51,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:51,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:51,522 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-03 18:22:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:51,968 INFO L93 Difference]: Finished difference Result 8298 states and 16433 transitions. [2022-03-03 18:22:51,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:51,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:51,979 INFO L225 Difference]: With dead ends: 8298 [2022-03-03 18:22:51,979 INFO L226 Difference]: Without dead ends: 8298 [2022-03-03 18:22:51,979 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-03 18:22:51,980 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 656 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03 18:22:51,980 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-03 18:22:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2022-03-03 18:22:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 4091. [2022-03-03 18:22:52,036 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-03 18:22:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-03 18:22:52,040 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-03 18:22:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:52,040 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-03 18:22:52,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-03 18:22:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:52,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:52,042 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:52,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:52,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-03 18:22:52,255 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-03 18:22:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -151065913, now seen corresponding path program 38 times [2022-03-03 18:22:52,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:52,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229410416] [2022-03-03 18:22:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:52,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:52,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229410416] [2022-03-03 18:22:52,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229410416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:52,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793641470] [2022-03-03 18:22:52,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:52,464 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:52,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-03 18:22:52,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:52,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:52,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:52,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:52,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:52,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:52,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793641470] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:52,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:52,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:52,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568906875] [2022-03-03 18:22:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:52,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:52,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:52,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:52,939 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-03 18:22:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:53,588 INFO L93 Difference]: Finished difference Result 9996 states and 19805 transitions. [2022-03-03 18:22:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:22:53,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:53,599 INFO L225 Difference]: With dead ends: 9996 [2022-03-03 18:22:53,599 INFO L226 Difference]: Without dead ends: 9996 [2022-03-03 18:22:53,600 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-03 18:22:53,600 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-03 18:22:53,601 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-03 18:22:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2022-03-03 18:22:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 4093. [2022-03-03 18:22:53,659 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-03 18:22:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 8080 transitions. [2022-03-03 18:22:53,663 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 8080 transitions. Word has length 105 [2022-03-03 18:22:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:53,664 INFO L470 AbstractCegarLoop]: Abstraction has 4093 states and 8080 transitions. [2022-03-03 18:22:53,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 8080 transitions. [2022-03-03 18:22:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:53,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:53,665 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:53,682 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-03 18:22:53,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-03 18:22:53,871 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-03 18:22:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1204375993, now seen corresponding path program 39 times [2022-03-03 18:22:53,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:53,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165699822] [2022-03-03 18:22:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:54,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:54,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165699822] [2022-03-03 18:22:54,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165699822] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:54,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163043339] [2022-03-03 18:22:54,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:54,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:54,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:54,020 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:54,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-03 18:22:54,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:54,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:54,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:54,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:54,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:54,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:54,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163043339] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:54,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:54,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:54,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443046007] [2022-03-03 18:22:54,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:54,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:54,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:54,538 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-03 18:22:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:55,422 INFO L93 Difference]: Finished difference Result 9499 states and 18787 transitions. [2022-03-03 18:22:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:22:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:55,433 INFO L225 Difference]: With dead ends: 9499 [2022-03-03 18:22:55,433 INFO L226 Difference]: Without dead ends: 9499 [2022-03-03 18:22:55,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 18:22:55,434 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-03 18:22:55,434 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-03 18:22:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2022-03-03 18:22:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 4073. [2022-03-03 18:22:55,485 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-03 18:22:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 8040 transitions. [2022-03-03 18:22:55,489 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 8040 transitions. Word has length 105 [2022-03-03 18:22:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:55,490 INFO L470 AbstractCegarLoop]: Abstraction has 4073 states and 8040 transitions. [2022-03-03 18:22:55,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 8040 transitions. [2022-03-03 18:22:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-03 18:22:55,491 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:55,491 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-03 18:22:55,511 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-03 18:22:55,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:55,708 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-03 18:22:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1890126863, now seen corresponding path program 1 times [2022-03-03 18:22:55,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:55,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899413513] [2022-03-03 18:22:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:55,755 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-03 18:22:55,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:55,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899413513] [2022-03-03 18:22:55,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899413513] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:55,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257071358] [2022-03-03 18:22:55,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:55,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:55,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:55,756 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:55,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-03 18:22:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:55,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 18:22:55,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:56,097 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-03 18:22:56,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:22:56,198 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-03 18:22:56,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257071358] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:22:56,198 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:22:56,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 18:22:56,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963191687] [2022-03-03 18:22:56,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:22:56,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:56,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:56,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:56,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 18:22:56,199 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-03 18:22:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:56,265 INFO L93 Difference]: Finished difference Result 7477 states and 14848 transitions. [2022-03-03 18:22:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:22:56,266 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-03 18:22:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:56,274 INFO L225 Difference]: With dead ends: 7477 [2022-03-03 18:22:56,274 INFO L226 Difference]: Without dead ends: 7477 [2022-03-03 18:22:56,274 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-03 18:22:56,274 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-03 18:22:56,274 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-03 18:22:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-03 18:22:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7321. [2022-03-03 18:22:56,342 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-03 18:22:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 14692 transitions. [2022-03-03 18:22:56,351 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 14692 transitions. Word has length 110 [2022-03-03 18:22:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:56,351 INFO L470 AbstractCegarLoop]: Abstraction has 7321 states and 14692 transitions. [2022-03-03 18:22:56,352 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-03 18:22:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 14692 transitions. [2022-03-03 18:22:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 18:22:56,353 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:56,353 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:56,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:56,558 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-03 18:22:56,559 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-03 18:22:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash -621139911, now seen corresponding path program 1 times [2022-03-03 18:22:56,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:56,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99468975] [2022-03-03 18:22:56,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-03-03 18:22:56,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:56,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99468975] [2022-03-03 18:22:56,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99468975] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:56,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:22:56,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:22:56,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777757659] [2022-03-03 18:22:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:56,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:22:56,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:22:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:22:56,632 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-03 18:22:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:56,813 INFO L93 Difference]: Finished difference Result 8193 states and 16446 transitions. [2022-03-03 18:22:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:22:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-03 18:22:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:56,823 INFO L225 Difference]: With dead ends: 8193 [2022-03-03 18:22:56,823 INFO L226 Difference]: Without dead ends: 7610 [2022-03-03 18:22:56,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:22:56,823 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.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:56,823 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.2s Time] [2022-03-03 18:22:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-03 18:22:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6942. [2022-03-03 18:22:56,907 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-03 18:22:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 13942 transitions. [2022-03-03 18:22:56,918 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 13942 transitions. Word has length 114 [2022-03-03 18:22:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:56,919 INFO L470 AbstractCegarLoop]: Abstraction has 6942 states and 13942 transitions. [2022-03-03 18:22:56,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 13942 transitions. [2022-03-03 18:22:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:22:56,922 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:56,922 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:56,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-03 18:22:56,922 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:22:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 901308923, now seen corresponding path program 1 times [2022-03-03 18:22:56,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:56,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7218644] [2022-03-03 18:22:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:57,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:57,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7218644] [2022-03-03 18:22:57,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7218644] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:57,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380125775] [2022-03-03 18:22:57,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:57,170 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:57,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-03 18:22:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:57,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:22:57,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:57,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:22:57,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:22:57,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:22:57,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:22:57,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:22:58,314 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:22:58,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-03 18:22:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:58,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:22:59,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) is different from false [2022-03-03 18:23:30,147 WARN L228 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 18:23:56,501 WARN L228 SmtUtils]: Spent 10.75s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 18:24:26,450 WARN L228 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 18:24:28,863 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1))))) is different from false [2022-03-03 18:24:28,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:28,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-03 18:24:36,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380125775] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:24:36,354 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:24:36,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:24:36,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593122035] [2022-03-03 18:24:36,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:24:36,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:24:36,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:24:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1186, Unknown=28, NotChecked=146, Total=1560 [2022-03-03 18:24:36,355 INFO L87 Difference]: Start difference. First operand 6942 states and 13942 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:41,347 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:24:43,420 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:24:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:46,858 INFO L93 Difference]: Finished difference Result 13034 states and 26055 transitions. [2022-03-03 18:24:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:24:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:24:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:46,877 INFO L225 Difference]: With dead ends: 13034 [2022-03-03 18:24:46,877 INFO L226 Difference]: Without dead ends: 13034 [2022-03-03 18:24:46,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 101.3s TimeCoverageRelationStatistics Valid=430, Invalid=2208, Unknown=30, NotChecked=412, Total=3080 [2022-03-03 18:24:46,878 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 1837 mSDsluCounter, 5065 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 5518 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1739 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:46,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1837 Valid, 5518 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2000 Invalid, 0 Unknown, 1739 Unchecked, 5.0s Time] [2022-03-03 18:24:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13034 states. [2022-03-03 18:24:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13034 to 6984. [2022-03-03 18:24:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6984 states, 6971 states have (on average 2.012049921101707) internal successors, (14026), 6983 states have internal predecessors, (14026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6984 states to 6984 states and 14026 transitions. [2022-03-03 18:24:46,977 INFO L78 Accepts]: Start accepts. Automaton has 6984 states and 14026 transitions. Word has length 134 [2022-03-03 18:24:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:46,977 INFO L470 AbstractCegarLoop]: Abstraction has 6984 states and 14026 transitions. [2022-03-03 18:24:46,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6984 states and 14026 transitions. [2022-03-03 18:24:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:46,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:46,980 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:24:46,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-03 18:24:47,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:47,182 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:24:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2095982239, now seen corresponding path program 2 times [2022-03-03 18:24:47,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:47,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488456685] [2022-03-03 18:24:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:24:48,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:48,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488456685] [2022-03-03 18:24:48,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488456685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:48,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249582915] [2022-03-03 18:24:48,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:24:48,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:48,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:48,197 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:24:48,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-03 18:24:48,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:24:48,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:48,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:24:48,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:49,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:24:49,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:24:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:49,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:24:49,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:49,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:49,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:49,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:24:50,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:50,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:50,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:50,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:50,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:50,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:50,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:24:51,009 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:24:51,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:24:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:51,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:24:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:24:51,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:53,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:53,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:54,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:54,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:24:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:24:55,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249582915] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:55,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:24:55,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:24:55,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700044457] [2022-03-03 18:24:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:24:55,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:24:55,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:24:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:24:55,182 INFO L87 Difference]: Start difference. First operand 6984 states and 14026 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:57,079 INFO L93 Difference]: Finished difference Result 9150 states and 18376 transitions. [2022-03-03 18:24:57,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:24:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:24:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:57,091 INFO L225 Difference]: With dead ends: 9150 [2022-03-03 18:24:57,091 INFO L226 Difference]: Without dead ends: 9150 [2022-03-03 18:24:57,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 18:24:57,092 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 274 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 822 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:57,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 1840 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 822 Unchecked, 0.7s Time] [2022-03-03 18:24:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9150 states. [2022-03-03 18:24:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9150 to 7006. [2022-03-03 18:24:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7006 states, 6993 states have (on average 2.012012012012012) internal successors, (14070), 7005 states have internal predecessors, (14070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7006 states to 7006 states and 14070 transitions. [2022-03-03 18:24:57,194 INFO L78 Accepts]: Start accepts. Automaton has 7006 states and 14070 transitions. Word has length 134 [2022-03-03 18:24:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:57,194 INFO L470 AbstractCegarLoop]: Abstraction has 7006 states and 14070 transitions. [2022-03-03 18:24:57,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:24:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7006 states and 14070 transitions. [2022-03-03 18:24:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:57,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:57,197 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:24:57,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-03 18:24:57,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-03 18:24:57,412 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:24:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 658342497, now seen corresponding path program 3 times [2022-03-03 18:24:57,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:57,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486652857] [2022-03-03 18:24:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:24:58,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:58,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486652857] [2022-03-03 18:24:58,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486652857] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:58,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476681552] [2022-03-03 18:24:58,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:24:58,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:58,417 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:24:58,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-03 18:24:58,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:24:58,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:58,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:24:58,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:59,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:24:59,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:24:59,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:59,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:25:00,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:25:00,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:00,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:25:01,357 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:25:01,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:25:01,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:01,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:25:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:25:01,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:04,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:04,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:05,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:05,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:25:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:25:05,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476681552] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:05,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:25:05,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:25:05,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848050622] [2022-03-03 18:25:05,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:05,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:25:05,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:25:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:25:05,639 INFO L87 Difference]: Start difference. First operand 7006 states and 14070 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:07,777 INFO L93 Difference]: Finished difference Result 9202 states and 18476 transitions. [2022-03-03 18:25:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:25:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:25:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:07,791 INFO L225 Difference]: With dead ends: 9202 [2022-03-03 18:25:07,791 INFO L226 Difference]: Without dead ends: 9202 [2022-03-03 18:25:07,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:25:07,791 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 288 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:07,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 1892 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 755 Unchecked, 0.7s Time] [2022-03-03 18:25:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9202 states. [2022-03-03 18:25:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9202 to 7010. [2022-03-03 18:25:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7010 states, 6997 states have (on average 2.0120051450621697) internal successors, (14078), 7009 states have internal predecessors, (14078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 14078 transitions. [2022-03-03 18:25:07,872 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 14078 transitions. Word has length 134 [2022-03-03 18:25:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:07,872 INFO L470 AbstractCegarLoop]: Abstraction has 7010 states and 14078 transitions. [2022-03-03 18:25:07,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 14078 transitions. [2022-03-03 18:25:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:25:07,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:07,875 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:07,895 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-03 18:25:08,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-03 18:25:08,093 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:25:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash -339667099, now seen corresponding path program 4 times [2022-03-03 18:25:08,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:08,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801215207] [2022-03-03 18:25:08,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:25:09,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:09,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801215207] [2022-03-03 18:25:09,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801215207] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:09,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641389026] [2022-03-03 18:25:09,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:25:09,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:09,119 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:25:09,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-03 18:25:09,576 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:25:09,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:25:09,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-03 18:25:09,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:10,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:25:10,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:25:10,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:10,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:25:10,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:10,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:10,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:10,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:25:11,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:11,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:11,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:11,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:11,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:11,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:11,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:25:11,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:11,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-03 18:25:11,927 INFO L353 Elim1Store]: treesize reduction 212, result has 14.2 percent of original size [2022-03-03 18:25:11,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 62 [2022-03-03 18:25:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:25:11,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:27,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:27,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:27,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-03 18:25:27,839 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-03 18:25:27,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:27,846 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-03 18:25:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:25:28,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641389026] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:28,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:28,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 38 [2022-03-03 18:25:28,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148584962] [2022-03-03 18:25:28,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:28,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-03 18:25:28,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-03 18:25:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1289, Unknown=1, NotChecked=0, Total=1482 [2022-03-03 18:25:28,615 INFO L87 Difference]: Start difference. First operand 7010 states and 14078 transitions. Second operand has 39 states, 38 states have (on average 5.394736842105263) internal successors, (205), 39 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:46,236 INFO L93 Difference]: Finished difference Result 10462 states and 20749 transitions. [2022-03-03 18:25:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-03 18:25:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 5.394736842105263) internal successors, (205), 39 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:25:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:46,249 INFO L225 Difference]: With dead ends: 10462 [2022-03-03 18:25:46,250 INFO L226 Difference]: Without dead ends: 10462 [2022-03-03 18:25:46,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=798, Invalid=4169, Unknown=3, NotChecked=0, Total=4970 [2022-03-03 18:25:46,250 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 1719 mSDsluCounter, 8662 mSDsCounter, 0 mSdLazyCounter, 3230 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 9302 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 3230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2148 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:46,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1719 Valid, 9302 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 3230 Invalid, 0 Unknown, 2148 Unchecked, 8.3s Time] [2022-03-03 18:25:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2022-03-03 18:25:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 6994. [2022-03-03 18:25:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6994 states, 6981 states have (on average 2.012032660077353) internal successors, (14046), 6993 states have internal predecessors, (14046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 14046 transitions. [2022-03-03 18:25:46,336 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 14046 transitions. Word has length 134 [2022-03-03 18:25:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:46,336 INFO L470 AbstractCegarLoop]: Abstraction has 6994 states and 14046 transitions. [2022-03-03 18:25:46,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 5.394736842105263) internal successors, (205), 39 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 14046 transitions. [2022-03-03 18:25:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:25:46,338 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:46,339 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:46,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-03 18:25:46,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-03 18:25:46,556 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:25:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:46,568 INFO L85 PathProgramCache]: Analyzing trace with hash -423512185, now seen corresponding path program 5 times [2022-03-03 18:25:46,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:46,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146376986] [2022-03-03 18:25:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:25:47,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:47,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146376986] [2022-03-03 18:25:47,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146376986] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:47,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138891006] [2022-03-03 18:25:47,530 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:25:47,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:47,531 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:25:47,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-03 18:25:47,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:25:47,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:25:47,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:25:47,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:50,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:25:50,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:50,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:25:50,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:50,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:50,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:50,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:25:51,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:25:51,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:51,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:25:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:25:51,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:54,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:54,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:25:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:25:56,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138891006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:56,461 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:56,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:25:56,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600826193] [2022-03-03 18:25:56,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:56,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:25:56,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:25:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:25:56,463 INFO L87 Difference]: Start difference. First operand 6994 states and 14046 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:06,228 INFO L93 Difference]: Finished difference Result 7795 states and 15569 transitions. [2022-03-03 18:26:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:26:06,229 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:26:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:06,239 INFO L225 Difference]: With dead ends: 7795 [2022-03-03 18:26:06,239 INFO L226 Difference]: Without dead ends: 7795 [2022-03-03 18:26:06,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=703, Invalid=2837, Unknown=0, NotChecked=0, Total=3540 [2022-03-03 18:26:06,240 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 1105 mSDsluCounter, 6992 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 7429 SdHoareTripleChecker+Invalid, 4111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1415 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:06,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1105 Valid, 7429 Invalid, 4111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2603 Invalid, 0 Unknown, 1415 Unchecked, 6.7s Time] [2022-03-03 18:26:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2022-03-03 18:26:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 7040. [2022-03-03 18:26:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7040 states, 7027 states have (on average 2.0122385086096486) internal successors, (14140), 7039 states have internal predecessors, (14140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7040 states to 7040 states and 14140 transitions. [2022-03-03 18:26:06,332 INFO L78 Accepts]: Start accepts. Automaton has 7040 states and 14140 transitions. Word has length 134 [2022-03-03 18:26:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:06,333 INFO L470 AbstractCegarLoop]: Abstraction has 7040 states and 14140 transitions. [2022-03-03 18:26:06,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7040 states and 14140 transitions. [2022-03-03 18:26:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:26:06,336 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:06,336 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:06,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-03 18:26:06,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-03 18:26:06,554 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:26:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:06,554 INFO L85 PathProgramCache]: Analyzing trace with hash -893918699, now seen corresponding path program 6 times [2022-03-03 18:26:06,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:06,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605655522] [2022-03-03 18:26:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:26:07,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:07,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605655522] [2022-03-03 18:26:07,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605655522] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:07,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142769539] [2022-03-03 18:26:07,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:26:07,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:07,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:07,556 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:26:07,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-03 18:26:07,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:26:07,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:26:07,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:26:07,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:08,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:26:09,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:26:09,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:26:09,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:26:09,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:09,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:26:10,442 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:26:10,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:26:10,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:10,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:26:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:26:10,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:13,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:13,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:14,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:14,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:26:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:26:14,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142769539] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:14,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:26:14,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:26:14,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243175797] [2022-03-03 18:26:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:14,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:26:14,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:26:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:26:14,908 INFO L87 Difference]: Start difference. First operand 7040 states and 14140 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:16,702 INFO L93 Difference]: Finished difference Result 9059 states and 18176 transitions. [2022-03-03 18:26:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:16,703 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:26:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:16,714 INFO L225 Difference]: With dead ends: 9059 [2022-03-03 18:26:16,714 INFO L226 Difference]: Without dead ends: 9059 [2022-03-03 18:26:16,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 18:26:16,714 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 226 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:16,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 1784 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 504 Unchecked, 0.5s Time] [2022-03-03 18:26:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9059 states. [2022-03-03 18:26:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9059 to 7068. [2022-03-03 18:26:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7068 states, 7055 states have (on average 2.01218993621545) internal successors, (14196), 7067 states have internal predecessors, (14196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7068 states to 7068 states and 14196 transitions. [2022-03-03 18:26:16,793 INFO L78 Accepts]: Start accepts. Automaton has 7068 states and 14196 transitions. Word has length 134 [2022-03-03 18:26:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:16,794 INFO L470 AbstractCegarLoop]: Abstraction has 7068 states and 14196 transitions. [2022-03-03 18:26:16,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7068 states and 14196 transitions. [2022-03-03 18:26:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:26:16,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:16,797 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:16,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-03 18:26:17,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-03-03 18:26:17,011 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:26:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1859931871, now seen corresponding path program 7 times [2022-03-03 18:26:17,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:17,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423025863] [2022-03-03 18:26:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:26:17,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:17,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423025863] [2022-03-03 18:26:17,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423025863] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:17,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661075723] [2022-03-03 18:26:17,951 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:26:17,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:17,959 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:26:17,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-03 18:26:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:18,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:26:18,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:19,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:26:19,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:26:20,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:26:20,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:26:21,334 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:26:21,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-03 18:26:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:26:21,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:30,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))))) is different from false [2022-03-03 18:27:03,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_31| 0)) (and (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5666 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2022-03-03 18:27:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 235 trivial. 2 not checked. [2022-03-03 18:27:10,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661075723] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:27:10,393 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:27:10,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:27:10,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929538542] [2022-03-03 18:27:10,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:27:10,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:27:10,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:27:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1224, Unknown=20, NotChecked=146, Total=1560 [2022-03-03 18:27:10,395 INFO L87 Difference]: Start difference. First operand 7068 states and 14196 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:14,621 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* (- 1) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_31| 0)) (and (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5666 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse7) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse7) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-03 18:27:21,590 WARN L228 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 58 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 18:27:23,787 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:27:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:27,916 INFO L93 Difference]: Finished difference Result 22480 states and 45237 transitions. [2022-03-03 18:27:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-03 18:27:27,916 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:27:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:27,943 INFO L225 Difference]: With dead ends: 22480 [2022-03-03 18:27:27,944 INFO L226 Difference]: Without dead ends: 22480 [2022-03-03 18:27:27,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 258 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=488, Invalid=3796, Unknown=22, NotChecked=524, Total=4830 [2022-03-03 18:27:27,948 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 1845 mSDsluCounter, 5841 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1845 SdHoareTripleChecker+Valid, 6321 SdHoareTripleChecker+Invalid, 4815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2886 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:27,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1845 Valid, 6321 Invalid, 4815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1864 Invalid, 0 Unknown, 2886 Unchecked, 4.7s Time] [2022-03-03 18:27:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22480 states. [2022-03-03 18:27:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22480 to 7094. [2022-03-03 18:27:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7094 states, 7081 states have (on average 2.0121451772348538) internal successors, (14248), 7093 states have internal predecessors, (14248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7094 states to 7094 states and 14248 transitions. [2022-03-03 18:27:28,089 INFO L78 Accepts]: Start accepts. Automaton has 7094 states and 14248 transitions. Word has length 134 [2022-03-03 18:27:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:28,089 INFO L470 AbstractCegarLoop]: Abstraction has 7094 states and 14248 transitions. [2022-03-03 18:27:28,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 14248 transitions. [2022-03-03 18:27:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:27:28,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:28,094 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:28,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-03 18:27:28,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-03 18:27:28,307 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:27:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash -798158221, now seen corresponding path program 8 times [2022-03-03 18:27:28,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:28,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080169834] [2022-03-03 18:27:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:27:29,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:29,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080169834] [2022-03-03 18:27:29,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080169834] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:29,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572819339] [2022-03-03 18:27:29,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:27:29,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:29,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:29,254 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:27:29,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-03 18:27:29,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:27:29,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:27:29,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:27:29,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:30,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:27:30,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:27:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:30,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:27:31,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:27:31,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:31,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:27:32,179 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:27:32,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:27:32,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:32,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:27:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:27:32,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:27:35,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:35,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:35,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:27:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:27:36,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572819339] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:36,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:27:36,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:27:36,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891783358] [2022-03-03 18:27:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:36,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:27:36,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:36,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:27:36,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:27:36,529 INFO L87 Difference]: Start difference. First operand 7094 states and 14248 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:37,994 INFO L93 Difference]: Finished difference Result 8732 states and 17522 transitions. [2022-03-03 18:27:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:27:37,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:27:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:38,004 INFO L225 Difference]: With dead ends: 8732 [2022-03-03 18:27:38,004 INFO L226 Difference]: Without dead ends: 8732 [2022-03-03 18:27:38,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 18:27:38,005 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 216 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:38,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 1763 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 420 Unchecked, 0.2s Time] [2022-03-03 18:27:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2022-03-03 18:27:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 7090. [2022-03-03 18:27:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7090 states, 7077 states have (on average 2.0121520418256322) internal successors, (14240), 7089 states have internal predecessors, (14240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7090 states to 7090 states and 14240 transitions. [2022-03-03 18:27:38,086 INFO L78 Accepts]: Start accepts. Automaton has 7090 states and 14240 transitions. Word has length 134 [2022-03-03 18:27:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:38,086 INFO L470 AbstractCegarLoop]: Abstraction has 7090 states and 14240 transitions. [2022-03-03 18:27:38,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 7090 states and 14240 transitions. [2022-03-03 18:27:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:27:38,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:38,088 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:38,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-03-03 18:27:38,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:38,299 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:27:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1776086785, now seen corresponding path program 9 times [2022-03-03 18:27:38,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:38,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427459430] [2022-03-03 18:27:38,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:27:39,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:39,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427459430] [2022-03-03 18:27:39,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427459430] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:39,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925590458] [2022-03-03 18:27:39,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:27:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:39,306 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:27:39,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-03 18:27:39,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:27:39,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:27:39,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:27:39,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:40,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:27:40,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:27:41,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:41,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:27:41,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:41,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:41,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:41,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:27:42,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:27:42,371 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:27:42,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:27:42,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:42,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:27:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:27:42,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:27:45,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:45,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:46,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:46,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:27:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:27:46,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925590458] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:46,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:27:46,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:27:46,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328584270] [2022-03-03 18:27:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:46,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:27:46,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:27:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:27:46,831 INFO L87 Difference]: Start difference. First operand 7090 states and 14240 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:49,404 INFO L93 Difference]: Finished difference Result 9124 states and 18329 transitions. [2022-03-03 18:27:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:27:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:27:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:49,415 INFO L225 Difference]: With dead ends: 9124 [2022-03-03 18:27:49,415 INFO L226 Difference]: Without dead ends: 9124 [2022-03-03 18:27:49,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=220, Invalid=1760, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:27:49,416 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 300 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 815 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:49,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 1881 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 815 Unchecked, 0.7s Time] [2022-03-03 18:27:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9124 states. [2022-03-03 18:27:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9124 to 7102. [2022-03-03 18:27:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7102 states, 7089 states have (on average 2.012131471293553) internal successors, (14264), 7101 states have internal predecessors, (14264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 14264 transitions. [2022-03-03 18:27:49,492 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 14264 transitions. Word has length 134 [2022-03-03 18:27:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:49,492 INFO L470 AbstractCegarLoop]: Abstraction has 7102 states and 14264 transitions. [2022-03-03 18:27:49,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 14264 transitions. [2022-03-03 18:27:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:27:49,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:49,494 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:49,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-03 18:27:49,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:49,712 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:27:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1853945391, now seen corresponding path program 10 times [2022-03-03 18:27:49,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:49,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220474466] [2022-03-03 18:27:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:27:50,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:50,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220474466] [2022-03-03 18:27:50,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220474466] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:50,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814122490] [2022-03-03 18:27:50,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:27:50,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:50,744 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:27:50,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-03 18:27:51,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:27:51,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:27:51,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:27:51,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:52,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:27:52,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:52,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:27:53,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:27:53,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:53,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:27:54,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:54,254 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:27:54,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:27:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:27:54,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:27:57,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:57,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:27:58,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814122490] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:27:58,937 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:27:58,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:27:58,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714051379] [2022-03-03 18:27:58,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:27:58,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:27:58,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:27:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:27:58,938 INFO L87 Difference]: Start difference. First operand 7102 states and 14264 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:06,170 INFO L93 Difference]: Finished difference Result 8068 states and 16120 transitions. [2022-03-03 18:28:06,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:28:06,170 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:28:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:06,179 INFO L225 Difference]: With dead ends: 8068 [2022-03-03 18:28:06,179 INFO L226 Difference]: Without dead ends: 8068 [2022-03-03 18:28:06,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=603, Invalid=2703, Unknown=0, NotChecked=0, Total=3306 [2022-03-03 18:28:06,184 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 1425 mSDsluCounter, 4867 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 5306 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 791 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:06,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 5306 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1803 Invalid, 0 Unknown, 791 Unchecked, 4.8s Time] [2022-03-03 18:28:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8068 states. [2022-03-03 18:28:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8068 to 7152. [2022-03-03 18:28:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7152 states, 7139 states have (on average 2.012326656394453) internal successors, (14366), 7151 states have internal predecessors, (14366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 14366 transitions. [2022-03-03 18:28:06,262 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 14366 transitions. Word has length 134 [2022-03-03 18:28:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:06,262 INFO L470 AbstractCegarLoop]: Abstraction has 7152 states and 14366 transitions. [2022-03-03 18:28:06,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 14366 transitions. [2022-03-03 18:28:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:28:06,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:06,265 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:06,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-03 18:28:06,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:06,483 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:28:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash 802601147, now seen corresponding path program 11 times [2022-03-03 18:28:06,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:06,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399211239] [2022-03-03 18:28:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:06,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:28:07,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:07,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399211239] [2022-03-03 18:28:07,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399211239] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:07,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665789899] [2022-03-03 18:28:07,446 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:28:07,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:07,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:07,447 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:28:07,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-03 18:28:07,858 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:28:07,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:28:07,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:28:07,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:10,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:28:10,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:10,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:28:10,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:10,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:10,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:10,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:28:11,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:28:11,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:11,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:28:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:28:11,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:28:14,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:14,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:28:16,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665789899] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:28:16,284 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:28:16,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:28:16,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317179216] [2022-03-03 18:28:16,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:28:16,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:28:16,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:16,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:28:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1454, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:28:16,285 INFO L87 Difference]: Start difference. First operand 7152 states and 14366 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:23,954 INFO L93 Difference]: Finished difference Result 8049 states and 16079 transitions. [2022-03-03 18:28:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:28:23,954 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:28:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:23,964 INFO L225 Difference]: With dead ends: 8049 [2022-03-03 18:28:23,964 INFO L226 Difference]: Without dead ends: 8049 [2022-03-03 18:28:23,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=583, Invalid=2723, Unknown=0, NotChecked=0, Total=3306 [2022-03-03 18:28:23,965 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 1313 mSDsluCounter, 4878 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 5325 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:23,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 5325 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1890 Invalid, 0 Unknown, 513 Unchecked, 5.1s Time] [2022-03-03 18:28:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8049 states. [2022-03-03 18:28:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8049 to 7160. [2022-03-03 18:28:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7160 states, 7147 states have (on average 2.0123128585420456) internal successors, (14382), 7159 states have internal predecessors, (14382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7160 states to 7160 states and 14382 transitions. [2022-03-03 18:28:24,038 INFO L78 Accepts]: Start accepts. Automaton has 7160 states and 14382 transitions. Word has length 134 [2022-03-03 18:28:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:24,038 INFO L470 AbstractCegarLoop]: Abstraction has 7160 states and 14382 transitions. [2022-03-03 18:28:24,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 7160 states and 14382 transitions. [2022-03-03 18:28:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:28:24,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:24,041 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:24,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-03-03 18:28:24,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-03-03 18:28:24,255 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:28:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash 718756061, now seen corresponding path program 12 times [2022-03-03 18:28:24,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:24,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915079027] [2022-03-03 18:28:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:28:25,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:25,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915079027] [2022-03-03 18:28:25,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915079027] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:25,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786561870] [2022-03-03 18:28:25,252 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:28:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:25,253 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:28:25,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-03 18:28:25,594 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:28:25,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:28:25,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:28:25,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:26,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:28:26,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:28:26,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:26,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:28:27,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:27,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:27,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:28:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:28:28,284 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:28:28,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:28:28,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:28,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:28:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:28:28,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:28:31,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:31,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:28:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:28:32,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786561870] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:32,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:28:32,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:28:32,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907504310] [2022-03-03 18:28:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:32,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:28:32,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:28:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:28:32,944 INFO L87 Difference]: Start difference. First operand 7160 states and 14382 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:34,494 INFO L93 Difference]: Finished difference Result 8766 states and 17591 transitions. [2022-03-03 18:28:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:28:34,495 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:28:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:34,505 INFO L225 Difference]: With dead ends: 8766 [2022-03-03 18:28:34,505 INFO L226 Difference]: Without dead ends: 8766 [2022-03-03 18:28:34,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 18:28:34,508 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 216 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:34,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 1608 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 459 Unchecked, 0.2s Time] [2022-03-03 18:28:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8766 states. [2022-03-03 18:28:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8766 to 7162. [2022-03-03 18:28:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7162 states, 7149 states have (on average 2.0123094139040427) internal successors, (14386), 7161 states have internal predecessors, (14386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7162 states to 7162 states and 14386 transitions. [2022-03-03 18:28:34,621 INFO L78 Accepts]: Start accepts. Automaton has 7162 states and 14386 transitions. Word has length 134 [2022-03-03 18:28:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:34,621 INFO L470 AbstractCegarLoop]: Abstraction has 7162 states and 14386 transitions. [2022-03-03 18:28:34,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 7162 states and 14386 transitions. [2022-03-03 18:28:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:28:34,623 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:34,624 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:34,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-03 18:28:34,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-03-03 18:28:34,839 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:28:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1383691181, now seen corresponding path program 13 times [2022-03-03 18:28:34,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:34,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140784850] [2022-03-03 18:28:34,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:34,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:28:35,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:35,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140784850] [2022-03-03 18:28:35,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140784850] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:35,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216992266] [2022-03-03 18:28:35,806 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:28:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:35,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:35,808 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:28:35,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-03 18:28:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:36,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:28:36,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:37,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:28:37,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:37,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:28:38,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:28:38,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:38,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:28:39,189 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:28:39,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-03 18:28:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:28:39,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:28:42,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_6585 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-03 18:28:44,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-03 18:28:46,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) is different from false [2022-03-03 18:29:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-03 18:29:17,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216992266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:29:17,858 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:29:17,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:29:17,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725898717] [2022-03-03 18:29:17,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:29:17,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:29:17,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:29:17,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:29:17,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1168, Unknown=16, NotChecked=216, Total=1560 [2022-03-03 18:29:17,859 INFO L87 Difference]: Start difference. First operand 7162 states and 14386 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:22,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (* (- 1) |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-03-03 18:29:24,996 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-03-03 18:29:27,118 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:29:29,223 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-03-03 18:29:31,300 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_6585 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))))) is different from false [2022-03-03 18:29:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:29:37,000 INFO L93 Difference]: Finished difference Result 14745 states and 29568 transitions. [2022-03-03 18:29:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:29:37,000 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:29:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:29:37,023 INFO L225 Difference]: With dead ends: 14745 [2022-03-03 18:29:37,023 INFO L226 Difference]: Without dead ends: 14745 [2022-03-03 18:29:37,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=340, Invalid=2121, Unknown=21, NotChecked=824, Total=3306 [2022-03-03 18:29:37,024 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 1562 mSDsluCounter, 5842 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 6318 SdHoareTripleChecker+Invalid, 5893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2851 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:29:37,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1562 Valid, 6318 Invalid, 5893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2966 Invalid, 0 Unknown, 2851 Unchecked, 7.7s Time] [2022-03-03 18:29:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14745 states. [2022-03-03 18:29:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14745 to 7164. [2022-03-03 18:29:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7164 states, 7151 states have (on average 2.0123059711928404) internal successors, (14390), 7163 states have internal predecessors, (14390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7164 states to 7164 states and 14390 transitions. [2022-03-03 18:29:37,149 INFO L78 Accepts]: Start accepts. Automaton has 7164 states and 14390 transitions. Word has length 134 [2022-03-03 18:29:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:29:37,150 INFO L470 AbstractCegarLoop]: Abstraction has 7164 states and 14390 transitions. [2022-03-03 18:29:37,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7164 states and 14390 transitions. [2022-03-03 18:29:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:29:37,152 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:29:37,152 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:29:37,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-03-03 18:29:37,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:29:37,370 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:29:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:29:37,370 INFO L85 PathProgramCache]: Analyzing trace with hash 708812915, now seen corresponding path program 14 times [2022-03-03 18:29:37,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:29:37,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334074427] [2022-03-03 18:29:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:29:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:29:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:29:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:29:38,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:29:38,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334074427] [2022-03-03 18:29:38,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334074427] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:38,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350774626] [2022-03-03 18:29:38,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:29:38,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:29:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:29:38,303 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:29:38,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-03 18:29:38,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:29:38,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:29:38,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:29:38,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:29:39,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:29:39,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:29:40,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:40,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:29:40,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:40,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:40,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:29:41,056 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:29:41,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:29:41,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:29:41,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:41,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:29:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:29:41,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:29:44,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:44,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:45,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:45,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:29:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:29:45,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350774626] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:45,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:29:45,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:29:45,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491821675] [2022-03-03 18:29:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:29:45,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:29:45,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:29:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:29:45,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:29:45,974 INFO L87 Difference]: Start difference. First operand 7164 states and 14390 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:29:48,358 INFO L93 Difference]: Finished difference Result 9210 states and 18500 transitions. [2022-03-03 18:29:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:29:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:29:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:29:48,370 INFO L225 Difference]: With dead ends: 9210 [2022-03-03 18:29:48,370 INFO L226 Difference]: Without dead ends: 9210 [2022-03-03 18:29:48,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=197, Invalid=1695, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:29:48,370 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 272 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 745 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:29:48,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 1908 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 745 Unchecked, 0.7s Time] [2022-03-03 18:29:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9210 states. [2022-03-03 18:29:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9210 to 7168. [2022-03-03 18:29:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7155 states have (on average 2.0122990915443744) internal successors, (14398), 7167 states have internal predecessors, (14398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 14398 transitions. [2022-03-03 18:29:48,453 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 14398 transitions. Word has length 134 [2022-03-03 18:29:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:29:48,453 INFO L470 AbstractCegarLoop]: Abstraction has 7168 states and 14398 transitions. [2022-03-03 18:29:48,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 14398 transitions. [2022-03-03 18:29:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:29:48,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:29:48,456 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:29:48,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-03 18:29:48,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:29:48,673 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:29:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:29:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash 731905745, now seen corresponding path program 15 times [2022-03-03 18:29:48,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:29:48,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462740715] [2022-03-03 18:29:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:29:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:29:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:29:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:29:49,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:29:49,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462740715] [2022-03-03 18:29:49,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462740715] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:49,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418158434] [2022-03-03 18:29:49,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:29:49,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:29:49,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:29:49,652 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:29:49,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-03 18:29:49,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:29:49,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:29:50,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:29:50,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:29:50,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:29:51,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 11 treesize of output 7 [2022-03-03 18:29:51,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:51,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:29:51,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:51,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:51,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:51,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:29:52,321 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:29:52,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:29:52,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:29:52,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:29:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:29:52,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:29:55,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:55,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:56,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:56,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:29:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:29:57,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418158434] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:57,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:29:57,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:29:57,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313598772] [2022-03-03 18:29:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:29:57,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:29:57,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:29:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:29:57,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:29:57,157 INFO L87 Difference]: Start difference. First operand 7168 states and 14398 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:29:59,846 INFO L93 Difference]: Finished difference Result 9210 states and 18500 transitions. [2022-03-03 18:29:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:29:59,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:29:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:29:59,857 INFO L225 Difference]: With dead ends: 9210 [2022-03-03 18:29:59,857 INFO L226 Difference]: Without dead ends: 9210 [2022-03-03 18:29:59,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:29:59,857 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 272 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1068 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:29:59,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 1903 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 1068 Unchecked, 0.7s Time] [2022-03-03 18:29:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9210 states. [2022-03-03 18:29:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9210 to 7170. [2022-03-03 18:29:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7157 states have (on average 2.0122956546038844) internal successors, (14402), 7169 states have internal predecessors, (14402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 14402 transitions. [2022-03-03 18:29:59,935 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 14402 transitions. Word has length 134 [2022-03-03 18:29:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:29:59,935 INFO L470 AbstractCegarLoop]: Abstraction has 7170 states and 14402 transitions. [2022-03-03 18:29:59,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 14402 transitions. [2022-03-03 18:29:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:29:59,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:29:59,938 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:29:59,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-03 18:30:00,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-03 18:30:00,155 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:30:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:30:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash 731930855, now seen corresponding path program 16 times [2022-03-03 18:30:00,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:30:00,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63865875] [2022-03-03 18:30:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:30:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:30:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:30:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:01,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:30:01,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63865875] [2022-03-03 18:30:01,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63865875] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:30:01,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901187545] [2022-03-03 18:30:01,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:30:01,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:30:01,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:30:01,038 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:30:01,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-03 18:30:01,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:30:01,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:30:01,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:30:01,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:30:03,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:30:03,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:03,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:30:03,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:03,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:03,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:03,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:30:04,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,412 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:30:04,412 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 37 treesize of output 42 [2022-03-03 18:30:04,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:04,589 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:30:04,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:30:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:04,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:30:06,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:06,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:06,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:06,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:08,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901187545] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:30:08,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:30:08,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2022-03-03 18:30:08,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401064764] [2022-03-03 18:30:08,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:30:08,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:30:08,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:30:08,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:30:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1387, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:30:08,172 INFO L87 Difference]: Start difference. First operand 7170 states and 14402 transitions. Second operand has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:30:16,554 INFO L93 Difference]: Finished difference Result 8299 states and 16577 transitions. [2022-03-03 18:30:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:30:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:30:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:30:16,565 INFO L225 Difference]: With dead ends: 8299 [2022-03-03 18:30:16,565 INFO L226 Difference]: Without dead ends: 8299 [2022-03-03 18:30:16,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 243 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=752, Invalid=3030, Unknown=0, NotChecked=0, Total=3782 [2022-03-03 18:30:16,566 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 1552 mSDsluCounter, 4681 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 5145 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:30:16,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1552 Valid, 5145 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1897 Invalid, 0 Unknown, 701 Unchecked, 5.1s Time] [2022-03-03 18:30:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2022-03-03 18:30:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 7050. [2022-03-03 18:30:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7037 states have (on average 2.012221116953247) internal successors, (14160), 7049 states have internal predecessors, (14160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 14160 transitions. [2022-03-03 18:30:16,686 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 14160 transitions. Word has length 134 [2022-03-03 18:30:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:30:16,686 INFO L470 AbstractCegarLoop]: Abstraction has 7050 states and 14160 transitions. [2022-03-03 18:30:16,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 14160 transitions. [2022-03-03 18:30:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:30:16,697 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:30:16,697 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:30:16,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-03 18:30:16,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-03 18:30:16,903 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:30:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:30:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1570150843, now seen corresponding path program 17 times [2022-03-03 18:30:16,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:30:16,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096831011] [2022-03-03 18:30:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:30:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:30:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:30:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:17,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:30:17,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096831011] [2022-03-03 18:30:17,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096831011] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:30:17,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591190598] [2022-03-03 18:30:17,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:30:17,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:30:17,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:30:17,928 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:30:17,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-03 18:30:18,549 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:30:18,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:30:18,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:30:18,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:30:20,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:30:20,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:20,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:30:21,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:30:21,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:21,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:30:22,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:22,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:30:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:22,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:30:25,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:25,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:27,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591190598] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:30:27,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:30:27,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:30:27,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067894014] [2022-03-03 18:30:27,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:30:27,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:30:27,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:30:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:30:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:30:27,055 INFO L87 Difference]: Start difference. First operand 7050 states and 14160 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:30:33,373 INFO L93 Difference]: Finished difference Result 7705 states and 15389 transitions. [2022-03-03 18:30:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 18:30:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:30:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:30:33,383 INFO L225 Difference]: With dead ends: 7705 [2022-03-03 18:30:33,384 INFO L226 Difference]: Without dead ends: 7705 [2022-03-03 18:30:33,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=542, Invalid=2650, Unknown=0, NotChecked=0, Total=3192 [2022-03-03 18:30:33,399 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 1252 mSDsluCounter, 5103 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 5546 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 902 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:30:33,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1252 Valid, 5546 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1460 Invalid, 0 Unknown, 902 Unchecked, 3.8s Time] [2022-03-03 18:30:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7705 states. [2022-03-03 18:30:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7705 to 7064. [2022-03-03 18:30:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7064 states, 7051 states have (on average 2.0121968515104243) internal successors, (14188), 7063 states have internal predecessors, (14188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7064 states to 7064 states and 14188 transitions. [2022-03-03 18:30:33,507 INFO L78 Accepts]: Start accepts. Automaton has 7064 states and 14188 transitions. Word has length 134 [2022-03-03 18:30:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:30:33,507 INFO L470 AbstractCegarLoop]: Abstraction has 7064 states and 14188 transitions. [2022-03-03 18:30:33,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7064 states and 14188 transitions. [2022-03-03 18:30:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:30:33,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:30:33,510 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:30:33,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-03 18:30:33,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:30:33,728 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:30:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:30:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2059881333, now seen corresponding path program 18 times [2022-03-03 18:30:33,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:30:33,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043163921] [2022-03-03 18:30:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:30:33,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:30:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:30:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:34,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:30:34,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043163921] [2022-03-03 18:30:34,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043163921] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:30:34,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36026597] [2022-03-03 18:30:34,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:30:34,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:30:34,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:30:34,723 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:30:34,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-03 18:30:35,094 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:30:35,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:30:35,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:30:35,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:30:35,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-03 18:30:36,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:30:36,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:36,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:30:37,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:30:37,474 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:30:37,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:30:37,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:37,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:30:38,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:38,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:30:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:30:38,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:30:41,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:41,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:41,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:30:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:30:42,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36026597] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:30:42,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:30:42,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:30:42,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949720460] [2022-03-03 18:30:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:30:42,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:30:42,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:30:42,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:30:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:30:42,561 INFO L87 Difference]: Start difference. First operand 7064 states and 14188 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:30:45,535 INFO L93 Difference]: Finished difference Result 9127 states and 18332 transitions. [2022-03-03 18:30:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:30:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:30:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:30:45,548 INFO L225 Difference]: With dead ends: 9127 [2022-03-03 18:30:45,548 INFO L226 Difference]: Without dead ends: 9127 [2022-03-03 18:30:45,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=218, Invalid=1762, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:30:45,549 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 305 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 733 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:30:45,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 1894 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 733 Unchecked, 0.7s Time] [2022-03-03 18:30:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2022-03-03 18:30:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 7070. [2022-03-03 18:30:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7070 states, 7057 states have (on average 2.012186481507723) internal successors, (14200), 7069 states have internal predecessors, (14200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7070 states to 7070 states and 14200 transitions. [2022-03-03 18:30:45,627 INFO L78 Accepts]: Start accepts. Automaton has 7070 states and 14200 transitions. Word has length 134 [2022-03-03 18:30:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:30:45,627 INFO L470 AbstractCegarLoop]: Abstraction has 7070 states and 14200 transitions. [2022-03-03 18:30:45,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:30:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7070 states and 14200 transitions. [2022-03-03 18:30:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:30:45,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:30:45,629 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:30:45,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-03 18:30:45,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-03 18:30:45,843 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:30:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:30:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2036763393, now seen corresponding path program 19 times [2022-03-03 18:30:45,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:30:45,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609512257] [2022-03-03 18:30:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:30:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:30:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:30:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:46,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:30:46,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609512257] [2022-03-03 18:30:46,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609512257] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:30:46,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928465560] [2022-03-03 18:30:46,759 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:30:46,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:30:46,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:30:46,760 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:30:46,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-03 18:30:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:30:47,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:30:47,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:30:48,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 11 treesize of output 7 [2022-03-03 18:30:48,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:48,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:30:49,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:49,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:49,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:49,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:30:49,912 INFO L353 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2022-03-03 18:30:49,912 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 44 treesize of output 49 [2022-03-03 18:30:50,126 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-03 18:30:50,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:30:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:30:50,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:31:40,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_49| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (< (+ (* |v_t_funThread1of1ForFork0_~i~0#1_49| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|))) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_49| 0)))) is different from false [2022-03-03 18:31:43,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (not (<= |v_t_funThread1of1ForFork0_~i~0#1_49| 0)) (< (+ (* |v_t_funThread1of1ForFork0_~i~0#1_49| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|) (and (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))))) is different from false [2022-03-03 18:31:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-03 18:31:46,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928465560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:31:46,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:31:46,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2022-03-03 18:31:46,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279255230] [2022-03-03 18:31:46,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:31:46,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-03 18:31:46,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:31:46,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-03 18:31:46,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1170, Unknown=21, NotChecked=142, Total=1482 [2022-03-03 18:31:46,090 INFO L87 Difference]: Start difference. First operand 7070 states and 14200 transitions. Second operand has 39 states, 38 states have (on average 6.105263157894737) internal successors, (232), 39 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:31:49,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (not (<= |v_t_funThread1of1ForFork0_~i~0#1_49| 0)) (< (+ (* |v_t_funThread1of1ForFork0_~i~0#1_49| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|) (and (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-03 18:31:51,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_49| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (< (+ (* |v_t_funThread1of1ForFork0_~i~0#1_49| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|))) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_49| 0)))) (= |c_~#cache~0.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-03 18:31:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:31:59,227 INFO L93 Difference]: Finished difference Result 16507 states and 33142 transitions. [2022-03-03 18:31:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:31:59,227 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 6.105263157894737) internal successors, (232), 39 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:31:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:31:59,248 INFO L225 Difference]: With dead ends: 16507 [2022-03-03 18:31:59,249 INFO L226 Difference]: Without dead ends: 16507 [2022-03-03 18:31:59,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 64.5s TimeCoverageRelationStatistics Valid=459, Invalid=2839, Unknown=24, NotChecked=460, Total=3782 [2022-03-03 18:31:59,249 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 1635 mSDsluCounter, 4111 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 4474 SdHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2454 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:31:59,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1635 Valid, 4474 Invalid, 4234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1735 Invalid, 0 Unknown, 2454 Unchecked, 4.5s Time] [2022-03-03 18:31:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2022-03-03 18:31:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 7110. [2022-03-03 18:31:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 7097 states have (on average 2.0121177962519377) internal successors, (14280), 7109 states have internal predecessors, (14280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:31:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 14280 transitions. [2022-03-03 18:31:59,378 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 14280 transitions. Word has length 134 [2022-03-03 18:31:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:31:59,392 INFO L470 AbstractCegarLoop]: Abstraction has 7110 states and 14280 transitions. [2022-03-03 18:31:59,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 6.105263157894737) internal successors, (232), 39 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:31:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 14280 transitions. [2022-03-03 18:31:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:31:59,395 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:31:59,395 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:31:59,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-03 18:31:59,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:31:59,608 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:31:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:31:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash 510795797, now seen corresponding path program 20 times [2022-03-03 18:31:59,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:31:59,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573361655] [2022-03-03 18:31:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:31:59,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:31:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:32:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:00,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:32:00,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573361655] [2022-03-03 18:32:00,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573361655] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:32:00,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351083934] [2022-03-03 18:32:00,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:32:00,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:00,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:32:00,685 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:32:00,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-03 18:32:01,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:32:01,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:32:01,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:32:01,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:32:01,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:32:02,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:32:02,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:32:03,220 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:32:03,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:32:03,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:32:03,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:32:03,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:03,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:32:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:32:04,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:32:06,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:06,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:06,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:06,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:06,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:06,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:07,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:07,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:07,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:07,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:07,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:32:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:32:08,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351083934] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:32:08,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:32:08,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:32:08,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176509171] [2022-03-03 18:32:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:32:08,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:32:08,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:32:08,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:32:08,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1306, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:32:08,548 INFO L87 Difference]: Start difference. First operand 7110 states and 14280 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:32:11,358 INFO L93 Difference]: Finished difference Result 9104 states and 18288 transitions. [2022-03-03 18:32:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:32:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:32:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:32:11,370 INFO L225 Difference]: With dead ends: 9104 [2022-03-03 18:32:11,370 INFO L226 Difference]: Without dead ends: 9104 [2022-03-03 18:32:11,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=217, Invalid=1763, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:32:11,371 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 261 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 781 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:32:11,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 1860 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 781 Unchecked, 0.7s Time] [2022-03-03 18:32:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9104 states. [2022-03-03 18:32:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9104 to 7110. [2022-03-03 18:32:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 7097 states have (on average 2.0121177962519377) internal successors, (14280), 7109 states have internal predecessors, (14280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 14280 transitions. [2022-03-03 18:32:11,457 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 14280 transitions. Word has length 134 [2022-03-03 18:32:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:32:11,458 INFO L470 AbstractCegarLoop]: Abstraction has 7110 states and 14280 transitions. [2022-03-03 18:32:11,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 14280 transitions. [2022-03-03 18:32:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:32:11,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:32:11,461 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:32:11,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-03-03 18:32:11,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:11,665 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:32:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:32:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -468459355, now seen corresponding path program 21 times [2022-03-03 18:32:11,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:32:11,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350174196] [2022-03-03 18:32:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:32:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:32:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:32:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:12,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:32:12,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350174196] [2022-03-03 18:32:12,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350174196] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:32:12,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070551516] [2022-03-03 18:32:12,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:32:12,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:12,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:32:12,616 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:32:12,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-03 18:32:12,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:32:12,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:32:12,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:32:12,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:32:13,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:32:14,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:32:14,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:14,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:32:14,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:14,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:14,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:14,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:32:15,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:32:15,587 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:32:15,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:32:15,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:15,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:32:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:32:16,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:32:18,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:18,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:19,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:19,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:32:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:32:20,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070551516] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:32:20,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:32:20,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:32:20,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269155831] [2022-03-03 18:32:20,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:32:20,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:32:20,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:32:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:32:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:32:20,385 INFO L87 Difference]: Start difference. First operand 7110 states and 14280 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:32:23,130 INFO L93 Difference]: Finished difference Result 9008 states and 18073 transitions. [2022-03-03 18:32:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:32:23,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:32:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:32:23,141 INFO L225 Difference]: With dead ends: 9008 [2022-03-03 18:32:23,141 INFO L226 Difference]: Without dead ends: 9008 [2022-03-03 18:32:23,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=202, Invalid=1690, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:32:23,142 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 208 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 703 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:32:23,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1820 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 703 Unchecked, 0.6s Time] [2022-03-03 18:32:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9008 states. [2022-03-03 18:32:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9008 to 7132. [2022-03-03 18:32:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7132 states, 7119 states have (on average 2.012080348363534) internal successors, (14324), 7131 states have internal predecessors, (14324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7132 states to 7132 states and 14324 transitions. [2022-03-03 18:32:23,220 INFO L78 Accepts]: Start accepts. Automaton has 7132 states and 14324 transitions. Word has length 134 [2022-03-03 18:32:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:32:23,220 INFO L470 AbstractCegarLoop]: Abstraction has 7132 states and 14324 transitions. [2022-03-03 18:32:23,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7132 states and 14324 transitions. [2022-03-03 18:32:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:32:23,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:32:23,223 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:32:23,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-03-03 18:32:23,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-03-03 18:32:23,425 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:32:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:32:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash -552304441, now seen corresponding path program 22 times [2022-03-03 18:32:23,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:32:23,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894405146] [2022-03-03 18:32:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:32:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:32:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:32:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:24,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:32:24,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894405146] [2022-03-03 18:32:24,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894405146] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:32:24,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219489996] [2022-03-03 18:32:24,360 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:32:24,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:24,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:32:24,361 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:32:24,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-03 18:32:24,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:32:24,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:32:24,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:32:24,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:32:26,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:32:26,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:26,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:32:27,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:32:27,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:32:27,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:27,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:32:27,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:32:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:28,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:32:31,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:31,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:32,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219489996] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:32:32,645 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:32:32,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:32:32,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907421466] [2022-03-03 18:32:32,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:32:32,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:32:32,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:32:32,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:32:32,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:32:32,646 INFO L87 Difference]: Start difference. First operand 7132 states and 14324 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:32:41,054 INFO L93 Difference]: Finished difference Result 8248 states and 16480 transitions. [2022-03-03 18:32:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:32:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:32:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:32:41,066 INFO L225 Difference]: With dead ends: 8248 [2022-03-03 18:32:41,066 INFO L226 Difference]: Without dead ends: 8248 [2022-03-03 18:32:41,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=651, Invalid=3009, Unknown=0, NotChecked=0, Total=3660 [2022-03-03 18:32:41,067 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 1606 mSDsluCounter, 4824 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 5267 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1102 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:32:41,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1606 Valid, 5267 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1927 Invalid, 0 Unknown, 1102 Unchecked, 5.2s Time] [2022-03-03 18:32:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2022-03-03 18:32:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 7184. [2022-03-03 18:32:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7184 states, 7171 states have (on average 2.0122716497001814) internal successors, (14430), 7183 states have internal predecessors, (14430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7184 states to 7184 states and 14430 transitions. [2022-03-03 18:32:41,170 INFO L78 Accepts]: Start accepts. Automaton has 7184 states and 14430 transitions. Word has length 134 [2022-03-03 18:32:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:32:41,170 INFO L470 AbstractCegarLoop]: Abstraction has 7184 states and 14430 transitions. [2022-03-03 18:32:41,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7184 states and 14430 transitions. [2022-03-03 18:32:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:32:41,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:32:41,172 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:32:41,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-03-03 18:32:41,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:41,387 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:32:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:32:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 299090341, now seen corresponding path program 23 times [2022-03-03 18:32:41,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:32:41,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942646] [2022-03-03 18:32:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:32:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:32:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:32:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:42,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:32:42,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942646] [2022-03-03 18:32:42,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942646] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:32:42,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040287359] [2022-03-03 18:32:42,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:32:42,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:42,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:32:42,397 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:32:42,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-03 18:32:42,920 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:32:42,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:32:42,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:32:42,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:32:44,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:32:44,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:44,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:32:45,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:32:45,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:32:45,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:45,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:32:45,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:32:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:45,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:32:49,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:49,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:32:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:50,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040287359] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:32:50,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:32:50,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:32:50,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090888573] [2022-03-03 18:32:50,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:32:50,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:32:50,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:32:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:32:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:32:50,705 INFO L87 Difference]: Start difference. First operand 7184 states and 14430 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:32:56,377 INFO L93 Difference]: Finished difference Result 8049 states and 16079 transitions. [2022-03-03 18:32:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:32:56,377 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:32:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:32:56,386 INFO L225 Difference]: With dead ends: 8049 [2022-03-03 18:32:56,386 INFO L226 Difference]: Without dead ends: 8049 [2022-03-03 18:32:56,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=487, Invalid=2483, Unknown=0, NotChecked=0, Total=2970 [2022-03-03 18:32:56,387 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 998 mSDsluCounter, 5539 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 5946 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:32:56,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [998 Valid, 5946 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1284 Invalid, 0 Unknown, 811 Unchecked, 3.5s Time] [2022-03-03 18:32:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8049 states. [2022-03-03 18:32:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8049 to 7188. [2022-03-03 18:32:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7188 states, 7175 states have (on average 2.0122648083623695) internal successors, (14438), 7187 states have internal predecessors, (14438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 14438 transitions. [2022-03-03 18:32:56,465 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 14438 transitions. Word has length 134 [2022-03-03 18:32:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:32:56,465 INFO L470 AbstractCegarLoop]: Abstraction has 7188 states and 14438 transitions. [2022-03-03 18:32:56,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:32:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 14438 transitions. [2022-03-03 18:32:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:32:56,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:32:56,468 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:32:56,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-03 18:32:56,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:56,687 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:32:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:32:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash 964025461, now seen corresponding path program 24 times [2022-03-03 18:32:56,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:32:56,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134489414] [2022-03-03 18:32:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:32:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:32:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:32:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:32:57,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:32:57,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134489414] [2022-03-03 18:32:57,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134489414] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:32:57,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293337606] [2022-03-03 18:32:57,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:32:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:32:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:32:57,696 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:32:57,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-03 18:32:58,098 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:32:58,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:32:58,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:32:58,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:32:58,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:32:59,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:32:59,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:32:59,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:33:00,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:33:00,406 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:33:00,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:33:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:33:00,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:00,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:33:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:33:01,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:33:03,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:03,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:03,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:04,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:04,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:04,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:04,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:04,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:04,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:04,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:04,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:33:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:33:05,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293337606] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:33:05,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:33:05,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:33:05,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313084342] [2022-03-03 18:33:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:05,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:33:05,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:33:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1322, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:33:05,511 INFO L87 Difference]: Start difference. First operand 7188 states and 14438 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:08,161 INFO L93 Difference]: Finished difference Result 9051 states and 18160 transitions. [2022-03-03 18:33:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:33:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:33:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:08,172 INFO L225 Difference]: With dead ends: 9051 [2022-03-03 18:33:08,172 INFO L226 Difference]: Without dead ends: 9051 [2022-03-03 18:33:08,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:33:08,173 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 206 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:08,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 1956 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 891 Unchecked, 0.6s Time] [2022-03-03 18:33:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2022-03-03 18:33:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 7192. [2022-03-03 18:33:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7192 states, 7179 states have (on average 2.01225797464828) internal successors, (14446), 7191 states have internal predecessors, (14446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7192 states to 7192 states and 14446 transitions. [2022-03-03 18:33:08,254 INFO L78 Accepts]: Start accepts. Automaton has 7192 states and 14446 transitions. Word has length 134 [2022-03-03 18:33:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:08,254 INFO L470 AbstractCegarLoop]: Abstraction has 7192 states and 14446 transitions. [2022-03-03 18:33:08,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7192 states and 14446 transitions. [2022-03-03 18:33:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:33:08,256 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:08,256 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:08,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-03-03 18:33:08,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:33:08,475 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:33:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 987118291, now seen corresponding path program 25 times [2022-03-03 18:33:08,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:08,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619761961] [2022-03-03 18:33:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:33:09,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:09,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619761961] [2022-03-03 18:33:09,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619761961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:33:09,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129552252] [2022-03-03 18:33:09,570 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:33:09,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:33:09,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:33:09,571 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:33:09,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-03 18:33:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:10,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:33:10,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:33:11,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:33:12,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:33:12,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:33:12,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:12,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:33:13,202 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:33:13,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-03 18:33:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:33:13,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:33:16,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) is different from false [2022-03-03 18:33:39,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) (and (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8421 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) is different from false [2022-03-03 18:33:43,251 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28)))) is different from false [2022-03-03 18:33:43,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:43,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:33:44,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129552252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:33:44,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:33:44,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:33:44,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976650479] [2022-03-03 18:33:44,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:33:44,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:33:44,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:33:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1179, Unknown=12, NotChecked=216, Total=1560 [2022-03-03 18:33:44,305 INFO L87 Difference]: Start difference. First operand 7192 states and 14446 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:49,041 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* (- 1) |c_~#cache~0.offset|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse2) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse2) 28)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8421 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse7 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-03 18:33:51,171 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) (and (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8421 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2022-03-03 18:33:55,514 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_8421 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-03-03 18:34:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:00,810 INFO L93 Difference]: Finished difference Result 12245 states and 24518 transitions. [2022-03-03 18:34:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 18:34:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:34:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:00,823 INFO L225 Difference]: With dead ends: 12245 [2022-03-03 18:34:00,824 INFO L226 Difference]: Without dead ends: 12245 [2022-03-03 18:34:00,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=244, Invalid=1834, Unknown=16, NotChecked=558, Total=2652 [2022-03-03 18:34:00,824 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 1035 mSDsluCounter, 5603 mSDsCounter, 0 mSdLazyCounter, 2835 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 5193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2299 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:00,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1035 Valid, 5972 Invalid, 5193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2835 Invalid, 0 Unknown, 2299 Unchecked, 7.5s Time] [2022-03-03 18:34:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12245 states. [2022-03-03 18:34:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12245 to 7278. [2022-03-03 18:34:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7278 states, 7265 states have (on average 2.012938747419133) internal successors, (14624), 7277 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7278 states to 7278 states and 14624 transitions. [2022-03-03 18:34:00,919 INFO L78 Accepts]: Start accepts. Automaton has 7278 states and 14624 transitions. Word has length 134 [2022-03-03 18:34:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:00,919 INFO L470 AbstractCegarLoop]: Abstraction has 7278 states and 14624 transitions. [2022-03-03 18:34:00,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 14624 transitions. [2022-03-03 18:34:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:34:00,922 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:00,922 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:34:00,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-03 18:34:01,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-03-03 18:34:01,140 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:34:01,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1918444487, now seen corresponding path program 26 times [2022-03-03 18:34:01,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:01,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213850745] [2022-03-03 18:34:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:01,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:34:02,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:02,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213850745] [2022-03-03 18:34:02,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213850745] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:02,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993262776] [2022-03-03 18:34:02,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:34:02,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:02,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:02,168 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:34:02,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-03 18:34:02,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:34:02,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:02,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:34:02,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:03,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:34:03,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:34:04,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:34:04,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:34:04,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:04,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:34:05,089 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:34:05,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:34:05,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:05,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:34:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:34:05,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:34:08,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:08,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:09,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:09,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:34:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:34:09,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993262776] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:09,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:34:09,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:34:09,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636606753] [2022-03-03 18:34:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:34:09,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:34:09,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:34:09,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:34:09,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:34:09,982 INFO L87 Difference]: Start difference. First operand 7278 states and 14624 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:14,799 INFO L93 Difference]: Finished difference Result 9223 states and 18530 transitions. [2022-03-03 18:34:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:34:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:34:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:14,811 INFO L225 Difference]: With dead ends: 9223 [2022-03-03 18:34:14,811 INFO L226 Difference]: Without dead ends: 9223 [2022-03-03 18:34:14,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=227, Invalid=1753, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:34:14,812 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 229 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:14,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 1666 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 698 Unchecked, 0.7s Time] [2022-03-03 18:34:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2022-03-03 18:34:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 7284. [2022-03-03 18:34:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7271 states have (on average 2.012928070416724) internal successors, (14636), 7283 states have internal predecessors, (14636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 14636 transitions. [2022-03-03 18:34:14,902 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 14636 transitions. Word has length 134 [2022-03-03 18:34:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:14,902 INFO L470 AbstractCegarLoop]: Abstraction has 7284 states and 14636 transitions. [2022-03-03 18:34:14,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 14636 transitions. [2022-03-03 18:34:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:34:14,905 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:14,905 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:34:14,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-03-03 18:34:15,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:15,107 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:34:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1711587689, now seen corresponding path program 27 times [2022-03-03 18:34:15,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:15,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732346512] [2022-03-03 18:34:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:34:16,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:16,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732346512] [2022-03-03 18:34:16,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732346512] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:16,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819624175] [2022-03-03 18:34:16,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:34:16,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:16,313 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:34:16,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-03 18:34:16,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:34:16,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:16,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:34:16,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:17,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:34:17,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:34:18,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:18,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:34:18,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:18,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:18,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:18,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:34:19,060 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:34:19,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:34:19,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:34:19,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:19,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:34:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:34:19,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:34:22,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:22,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:23,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:23,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:34:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:34:24,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819624175] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:24,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:34:24,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:34:24,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979600849] [2022-03-03 18:34:24,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:34:24,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:34:24,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:34:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:34:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:34:24,343 INFO L87 Difference]: Start difference. First operand 7284 states and 14636 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:28,354 INFO L93 Difference]: Finished difference Result 8787 states and 17665 transitions. [2022-03-03 18:34:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:34:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:34:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:28,365 INFO L225 Difference]: With dead ends: 8787 [2022-03-03 18:34:28,365 INFO L226 Difference]: Without dead ends: 8787 [2022-03-03 18:34:28,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:34:28,366 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 205 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:28,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 1185 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 399 Unchecked, 0.3s Time] [2022-03-03 18:34:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8787 states. [2022-03-03 18:34:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8787 to 7280. [2022-03-03 18:34:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7280 states, 7267 states have (on average 2.0129351864593366) internal successors, (14628), 7279 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7280 states to 7280 states and 14628 transitions. [2022-03-03 18:34:28,469 INFO L78 Accepts]: Start accepts. Automaton has 7280 states and 14628 transitions. Word has length 134 [2022-03-03 18:34:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:28,469 INFO L470 AbstractCegarLoop]: Abstraction has 7280 states and 14628 transitions. [2022-03-03 18:34:28,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 7280 states and 14628 transitions. [2022-03-03 18:34:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:34:28,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:28,488 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:34:28,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-03 18:34:28,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:28,703 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:34:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1688494859, now seen corresponding path program 28 times [2022-03-03 18:34:28,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:28,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576777248] [2022-03-03 18:34:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:34:29,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:29,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576777248] [2022-03-03 18:34:29,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576777248] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:29,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560152345] [2022-03-03 18:34:29,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:34:29,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:29,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:29,715 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:34:29,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-03 18:34:30,328 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:34:30,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:30,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-03 18:34:30,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:30,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:34:31,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:34:31,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:31,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:34:31,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:31,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:31,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:31,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:34:32,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-03 18:34:32,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:34:32,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:32,539 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:34:32,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:34:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:34:32,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:34:35,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:35,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:36,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:36,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:34:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:34:37,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560152345] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:34:37,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:34:37,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 39 [2022-03-03 18:34:37,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698730530] [2022-03-03 18:34:37,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:34:37,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:34:37,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:34:37,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:34:37,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1371, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:34:37,253 INFO L87 Difference]: Start difference. First operand 7280 states and 14628 transitions. Second operand has 40 states, 39 states have (on average 4.641025641025641) internal successors, (181), 40 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:53,318 INFO L93 Difference]: Finished difference Result 11514 states and 23001 transitions. [2022-03-03 18:34:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-03 18:34:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 4.641025641025641) internal successors, (181), 40 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:34:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:53,333 INFO L225 Difference]: With dead ends: 11514 [2022-03-03 18:34:53,333 INFO L226 Difference]: Without dead ends: 11514 [2022-03-03 18:34:53,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=796, Invalid=4316, Unknown=0, NotChecked=0, Total=5112 [2022-03-03 18:34:53,336 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1430 mSDsluCounter, 7346 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 7909 SdHoareTripleChecker+Invalid, 4790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1358 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:53,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1430 Valid, 7909 Invalid, 4790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 3254 Invalid, 0 Unknown, 1358 Unchecked, 9.2s Time] [2022-03-03 18:34:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2022-03-03 18:34:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 7350. [2022-03-03 18:34:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7350 states, 7337 states have (on average 2.0136295488619327) internal successors, (14774), 7349 states have internal predecessors, (14774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 14774 transitions. [2022-03-03 18:34:53,452 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 14774 transitions. Word has length 134 [2022-03-03 18:34:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:53,452 INFO L470 AbstractCegarLoop]: Abstraction has 7350 states and 14774 transitions. [2022-03-03 18:34:53,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.641025641025641) internal successors, (181), 40 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 14774 transitions. [2022-03-03 18:34:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:34:53,455 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:53,455 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:34:53,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-03-03 18:34:53,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-03-03 18:34:53,671 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:34:53,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -772834655, now seen corresponding path program 29 times [2022-03-03 18:34:53,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:53,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005181885] [2022-03-03 18:34:53,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:34:54,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:54,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005181885] [2022-03-03 18:34:54,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005181885] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:54,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087133560] [2022-03-03 18:34:54,688 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:34:54,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:54,689 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:34:54,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-03 18:34:55,244 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:34:55,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:55,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:34:55,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:57,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:34:57,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:57,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:34:58,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:34:58,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:58,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:34:59,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:59,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:34:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:34:59,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:35:02,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:02,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:35:03,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087133560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:35:03,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:35:03,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:35:03,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99571676] [2022-03-03 18:35:03,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:35:03,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:35:03,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:35:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:35:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:35:03,607 INFO L87 Difference]: Start difference. First operand 7350 states and 14774 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:35:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:35:13,274 INFO L93 Difference]: Finished difference Result 18340 states and 36710 transitions. [2022-03-03 18:35:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-03 18:35:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:35:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:35:13,299 INFO L225 Difference]: With dead ends: 18340 [2022-03-03 18:35:13,299 INFO L226 Difference]: Without dead ends: 18340 [2022-03-03 18:35:13,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 247 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=757, Invalid=3935, Unknown=0, NotChecked=0, Total=4692 [2022-03-03 18:35:13,300 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 2003 mSDsluCounter, 6241 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 6749 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 683 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:35:13,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2003 Valid, 6749 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2052 Invalid, 0 Unknown, 683 Unchecked, 5.6s Time] [2022-03-03 18:35:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18340 states. [2022-03-03 18:35:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18340 to 7362. [2022-03-03 18:35:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7362 states, 7349 states have (on average 2.013607293509321) internal successors, (14798), 7361 states have internal predecessors, (14798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:35:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 14798 transitions. [2022-03-03 18:35:13,442 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 14798 transitions. Word has length 134 [2022-03-03 18:35:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:35:13,442 INFO L470 AbstractCegarLoop]: Abstraction has 7362 states and 14798 transitions. [2022-03-03 18:35:13,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:35:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 14798 transitions. [2022-03-03 18:35:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:35:13,445 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:35:13,445 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:35:13,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-03-03 18:35:13,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:35:13,664 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:35:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:35:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1981015915, now seen corresponding path program 30 times [2022-03-03 18:35:13,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:35:13,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339040431] [2022-03-03 18:35:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:35:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:35:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:35:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:35:14,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:35:14,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339040431] [2022-03-03 18:35:14,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339040431] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:35:14,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290993588] [2022-03-03 18:35:14,698 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:35:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:35:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:35:14,699 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:35:14,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-03 18:35:15,126 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:35:15,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:35:15,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:35:15,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:35:15,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:35:16,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:35:16,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:16,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:35:16,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:16,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:16,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:35:17,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:35:17,702 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:35:17,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:35:17,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:17,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:18,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:18,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:18,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:18,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:18,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-03 18:35:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:35:18,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:35:20,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:20,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:35:21,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:21,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-03-03 18:35:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-03 18:35:22,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290993588] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:35:22,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:35:22,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:35:22,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816107077] [2022-03-03 18:35:22,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:35:22,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:35:22,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:35:22,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:35:22,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:35:22,121 INFO L87 Difference]: Start difference. First operand 7362 states and 14798 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:35:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:35:24,680 INFO L93 Difference]: Finished difference Result 9339 states and 18768 transitions. [2022-03-03 18:35:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:35:24,681 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 18:35:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:35:24,692 INFO L225 Difference]: With dead ends: 9339 [2022-03-03 18:35:24,692 INFO L226 Difference]: Without dead ends: 9339 [2022-03-03 18:35:24,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:35:24,692 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 234 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:35:24,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 1415 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 467 Unchecked, 0.7s Time] [2022-03-03 18:35:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9339 states. [2022-03-03 18:35:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9339 to 7378. [2022-03-03 18:35:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7365 states have (on average 2.0135777325186694) internal successors, (14830), 7377 states have internal predecessors, (14830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:35:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 14830 transitions. [2022-03-03 18:35:24,773 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 14830 transitions. Word has length 134 [2022-03-03 18:35:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:35:24,773 INFO L470 AbstractCegarLoop]: Abstraction has 7378 states and 14830 transitions. [2022-03-03 18:35:24,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:35:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 14830 transitions. [2022-03-03 18:35:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:35:24,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:35:24,776 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:35:24,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-03-03 18:35:24,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:35:24,994 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-03 18:35:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:35:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1897170829, now seen corresponding path program 31 times [2022-03-03 18:35:24,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:35:24,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954180946] [2022-03-03 18:35:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:35:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:35:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:35:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:35:26,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:35:26,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954180946] [2022-03-03 18:35:26,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954180946] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:35:26,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922301335] [2022-03-03 18:35:26,386 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:35:26,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:35:26,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:35:26,388 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:35:26,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-03 18:35:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:35:26,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:35:26,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:35:28,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:35:28,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:28,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:35:28,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:28,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:28,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:28,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:35:29,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:29,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:29,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:29,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:29,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:29,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:29,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:35:29,990 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:35:29,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-03 18:35:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:35:30,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:35:33,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))))) is different from false [2022-03-03 18:35:59,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104|) (and (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_9340 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_104| v_ArrVal_9340))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) is different from false Received shutdown request... [2022-03-03 18:36:08,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 18:36:08,219 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 18:36:08,501 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-03-03 18:36:08,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-03 18:36:08,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:36:08,702 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-03-03 18:36:08,704 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-03-03 18:36:08,716 INFO L732 BasicCegarLoop]: Path program histogram: [39, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:36:08,721 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 18:36:08,721 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 18:36:08,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:36:08 BasicIcfg [2022-03-03 18:36:08,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 18:36:08,731 INFO L158 Benchmark]: Toolchain (without parser) took 875265.26ms. Allocated memory was 177.2MB in the beginning and 723.5MB in the end (delta: 546.3MB). Free memory was 118.0MB in the beginning and 580.1MB in the end (delta: -462.0MB). Peak memory consumption was 85.1MB. Max. memory is 8.0GB. [2022-03-03 18:36:08,731 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 177.2MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 18:36:08,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.01ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 117.9MB in the beginning and 176.6MB in the end (delta: -58.7MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-03-03 18:36:08,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.62ms. Allocated memory is still 220.2MB. Free memory was 176.6MB in the beginning and 173.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 18:36:08,732 INFO L158 Benchmark]: Boogie Preprocessor took 33.98ms. Allocated memory is still 220.2MB. Free memory was 173.4MB in the beginning and 171.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 18:36:08,732 INFO L158 Benchmark]: RCFGBuilder took 415.42ms. Allocated memory is still 220.2MB. Free memory was 171.3MB in the beginning and 155.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-03 18:36:08,732 INFO L158 Benchmark]: TraceAbstraction took 874274.89ms. Allocated memory was 220.2MB in the beginning and 723.5MB in the end (delta: 503.3MB). Free memory was 154.6MB in the beginning and 580.1MB in the end (delta: -425.5MB). Peak memory consumption was 78.9MB. Max. memory is 8.0GB. [2022-03-03 18:36:08,732 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.31ms. Allocated memory is still 177.2MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 480.01ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 117.9MB in the beginning and 176.6MB in the end (delta: -58.7MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.62ms. Allocated memory is still 220.2MB. Free memory was 176.6MB in the beginning and 173.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.98ms. Allocated memory is still 220.2MB. Free memory was 173.4MB in the beginning and 171.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 415.42ms. Allocated memory is still 220.2MB. Free memory was 171.3MB in the beginning and 155.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 874274.89ms. Allocated memory was 220.2MB in the beginning and 723.5MB in the end (delta: 503.3MB). Free memory was 154.6MB in the beginning and 580.1MB in the end (delta: -425.5MB). Peak memory consumption was 78.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 939]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 939]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 936]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 161 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 874.2s, OverallIterations: 83, TraceHistogramMax: 10, PathProgramHistogramMax: 39, EmptinessCheckTime: 0.2s, AutomataDifference: 250.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72510 SdHoareTripleChecker+Valid, 116.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72510 mSDsluCounter, 198403 SdHoareTripleChecker+Invalid, 106.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 32913 IncrementalHoareTripleChecker+Unchecked, 172092 mSDsCounter, 2311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80531 IncrementalHoareTripleChecker+Invalid, 115755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2311 mSolverCounterUnsat, 26623 mSDtfsCounter, 80531 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15241 GetRequests, 12125 SyntacticMatches, 29 SemanticMatches, 3087 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 34526 ImplicationChecksByTransitivity, 535.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7378occurred in iteration=82, InterpolantAutomatonStates: 1670, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 82 MinimizatonAttempts, 382876 StatesRemovedByMinimization, 78 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 534.0s InterpolantComputationTime, 17670 NumberOfCodeBlocks, 15405 NumberOfCodeBlocksAsserted, 280 NumberOfCheckSat, 21775 ConstructedInterpolants, 388 QuantifiedInterpolants, 192050 SizeOfPredicates, 939 NumberOfNonLiveVariables, 17205 ConjunctsInSsa, 2510 ConjunctsInUnsatCore, 193 InterpolantComputations, 63 PerfectInterpolantSequences, 41037/43921 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown