/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 18:21:33,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 18:21:33,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 18:21:33,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 18:21:33,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 18:21:33,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 18:21:33,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 18:21:33,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 18:21:33,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 18:21:33,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 18:21:33,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 18:21:33,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 18:21:33,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 18:21:33,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 18:21:33,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 18:21:33,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 18:21:33,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 18:21:33,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 18:21:33,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 18:21:33,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 18:21:33,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 18:21:33,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 18:21:33,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 18:21:33,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 18:21:33,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 18:21:33,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 18:21:33,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 18:21:33,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 18:21:33,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 18:21:33,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 18:21:33,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 18:21:33,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 18:21:33,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 18:21:33,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 18:21:33,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 18:21:33,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 18:21:33,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 18:21:33,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 18:21:33,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 18:21:33,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 18:21:33,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 18:21:33,888 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:33,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 18:21:33,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 18:21:33,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 18:21:33,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 18:21:33,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 18:21:33,910 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 18:21:33,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 18:21:33,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 18:21:33,911 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 18:21:33,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 18:21:33,911 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 18:21:33,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 18:21:33,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 18:21:33,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 18:21:33,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 18:21:33,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 18:21:33,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 18:21:33,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 18:21:33,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 18:21:33,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 18:21:33,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 18:21:33,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 18:21:33,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 18:21:33,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 18:21:33,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 18:21:33,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:21:33,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 18:21:33,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 18:21:33,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 18:21:33,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 18:21:33,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 18:21:33,915 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 18:21:33,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 18:21:33,915 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:34,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 18:21:34,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 18:21:34,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 18:21:34,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 18:21:34,155 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 18:21:34,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-03-03 18:21:34,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2f2c566/c58a6eb58ea743189518cce0df6785eb/FLAG9a0b29b46 [2022-03-03 18:21:34,746 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 18:21:34,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-03-03 18:21:34,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2f2c566/c58a6eb58ea743189518cce0df6785eb/FLAG9a0b29b46 [2022-03-03 18:21:35,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2f2c566/c58a6eb58ea743189518cce0df6785eb [2022-03-03 18:21:35,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 18:21:35,196 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 18:21:35,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 18:21:35,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 18:21:35,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 18:21:35,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:21:35" (1/1) ... [2022-03-03 18:21:35,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c4030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:35, skipping insertion in model container [2022-03-03 18:21:35,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:21:35" (1/1) ... [2022-03-03 18:21:35,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 18:21:35,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 18:21:35,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:21:35,699 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 18:21:35,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:21:35,801 INFO L208 MainTranslator]: Completed translation [2022-03-03 18:21:35,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:35 WrapperNode [2022-03-03 18:21:35,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 18:21:35,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 18:21:35,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 18:21:35,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 18:21:35,810 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:35" (1/1) ... [2022-03-03 18:21:35,840 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:35" (1/1) ... [2022-03-03 18:21:35,878 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-03-03 18:21:35,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 18:21:35,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 18:21:35,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 18:21:35,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 18:21:35,886 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:35" (1/1) ... [2022-03-03 18:21:35,886 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:35" (1/1) ... [2022-03-03 18:21:35,903 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:35" (1/1) ... [2022-03-03 18:21:35,903 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:35" (1/1) ... [2022-03-03 18:21:35,911 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:35" (1/1) ... [2022-03-03 18:21:35,914 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:35" (1/1) ... [2022-03-03 18:21:35,928 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:35" (1/1) ... [2022-03-03 18:21:35,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 18:21:35,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 18:21:35,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 18:21:35,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 18:21:35,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:35" (1/1) ... [2022-03-03 18:21:35,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:21:35,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:35,968 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:35,990 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:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 18:21:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 18:21:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 18:21:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 18:21:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 18:21:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 18:21:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-03 18:21:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-03 18:21:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 18:21:36,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 18:21:36,007 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:36,188 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 18:21:36,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 18:21:36,447 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 18:21:36,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 18:21:36,453 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 18:21:36,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:21:36 BoogieIcfgContainer [2022-03-03 18:21:36,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 18:21:36,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 18:21:36,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 18:21:36,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 18:21:36,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:21:35" (1/3) ... [2022-03-03 18:21:36,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6e6828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:21:36, skipping insertion in model container [2022-03-03 18:21:36,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:21:35" (2/3) ... [2022-03-03 18:21:36,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6e6828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:21:36, skipping insertion in model container [2022-03-03 18:21:36,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:36" (3/3) ... [2022-03-03 18:21:36,461 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-03-03 18:21:36,465 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 18:21:36,466 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 18:21:36,466 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-03 18:21:36,466 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 18:21:36,507 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:36,507 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:36,507 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:36,507 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:36,508 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:36,508 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:36,508 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:36,508 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:36,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:36,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:36,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:36,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:36,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:36,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:36,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:36,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:36,510 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:36,510 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:36,510 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:36,510 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:36,510 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:36,510 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:36,510 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:36,511 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:36,511 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:36,511 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:36,511 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:36,511 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:36,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:36,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:36,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:36,512 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:36,512 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:36,512 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:36,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:36,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:36,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:36,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:36,513 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:36,513 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:36,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:36,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:36,513 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:36,513 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:36,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:36,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:36,514 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:36,514 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:36,514 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:36,514 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:36,514 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:36,514 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:36,515 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:36,515 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:36,516 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:36,516 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:36,516 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:36,516 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:36,517 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:36,517 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:36,517 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:36,517 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:36,517 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:36,517 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:36,517 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:36,518 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:36,518 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:36,518 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:36,518 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:36,518 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:36,519 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:36,519 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:36,520 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:36,520 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:36,521 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:36,521 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:36,521 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:36,521 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:36,522 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:36,522 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:36,522 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:36,522 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:36,524 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:36,524 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:36,524 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:36,524 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:36,524 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:36,525 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:36,525 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:36,525 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:36,525 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:36,525 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:36,525 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:36,526 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:36,526 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:36,526 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:36,526 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:36,526 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:36,526 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:36,527 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:36,527 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:36,527 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:36,527 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:36,527 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:36,527 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:36,528 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:36,528 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:36,528 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:36,528 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:36,528 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:36,529 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:36,529 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:36,530 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:36,530 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:36,531 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:36,531 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:36,531 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:36,531 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:36,531 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:36,531 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:36,532 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:36,532 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:36,532 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:36,532 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:36,532 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:36,533 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:36,534 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:36,534 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:36,534 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:36,534 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:36,534 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:36,534 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:36,536 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:36,536 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:36,536 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:36,536 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:36,536 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:36,537 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:36,537 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:36,537 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:36,537 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:36,537 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:36,537 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:36,538 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:36,538 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:36,538 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:36,538 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:36,538 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:36,538 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:36,538 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:36,539 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:36,539 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:36,542 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:36,542 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:36,542 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:36,542 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:36,542 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:36,543 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:36,543 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:36,543 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:36,543 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:36,543 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:36,543 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:36,544 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:36,544 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:36,545 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:36,546 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 18:21:36,588 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 18:21:36,595 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:36,596 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-03 18:21:36,610 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 128 transitions, 261 flow [2022-03-03 18:21:36,711 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:36,719 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:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-03 18:21:36,733 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:36,734 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:36,734 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:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash -88358338, now seen corresponding path program 1 times [2022-03-03 18:21:36,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:36,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166015398] [2022-03-03 18:21:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:36,956 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:36,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:36,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166015398] [2022-03-03 18:21:36,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166015398] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:36,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:36,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:21:36,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789532159] [2022-03-03 18:21:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:36,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 18:21:36,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 18:21:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 18:21:37,000 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:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:37,053 INFO L93 Difference]: Finished difference Result 2321 states and 4620 transitions. [2022-03-03 18:21:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 18:21:37,056 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:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:37,091 INFO L225 Difference]: With dead ends: 2321 [2022-03-03 18:21:37,092 INFO L226 Difference]: Without dead ends: 2321 [2022-03-03 18:21:37,093 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:37,097 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:37,099 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:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2022-03-03 18:21:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2022-03-03 18:21:37,237 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:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4620 transitions. [2022-03-03 18:21:37,250 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4620 transitions. Word has length 31 [2022-03-03 18:21:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:37,250 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 4620 transitions. [2022-03-03 18:21:37,250 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:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4620 transitions. [2022-03-03 18:21:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-03 18:21:37,252 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:37,252 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:37,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 18:21:37,253 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:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash -932830209, now seen corresponding path program 1 times [2022-03-03 18:21:37,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:37,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718225333] [2022-03-03 18:21:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:37,330 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:37,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:37,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718225333] [2022-03-03 18:21:37,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718225333] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:37,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:37,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 18:21:37,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203496483] [2022-03-03 18:21:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:37,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:37,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:37,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:21:37,333 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:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:37,362 INFO L93 Difference]: Finished difference Result 2325 states and 4624 transitions. [2022-03-03 18:21:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:37,363 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:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:37,372 INFO L225 Difference]: With dead ends: 2325 [2022-03-03 18:21:37,373 INFO L226 Difference]: Without dead ends: 2325 [2022-03-03 18:21:37,373 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:37,374 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:37,374 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:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-03-03 18:21:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2322. [2022-03-03 18:21:37,423 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:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4621 transitions. [2022-03-03 18:21:37,433 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 4621 transitions. Word has length 31 [2022-03-03 18:21:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:37,433 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 4621 transitions. [2022-03-03 18:21:37,433 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:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 4621 transitions. [2022-03-03 18:21:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-03 18:21:37,436 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:37,436 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:37,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 18:21:37,436 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:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash 527090186, now seen corresponding path program 1 times [2022-03-03 18:21:37,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:37,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368821481] [2022-03-03 18:21:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:37,536 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:37,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:37,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368821481] [2022-03-03 18:21:37,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368821481] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:37,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353813606] [2022-03-03 18:21:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:37,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:37,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:37,539 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:37,545 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:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:37,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-03 18:21:37,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:37,782 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:37,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:37,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353813606] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:37,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:37,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-03 18:21:37,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212017068] [2022-03-03 18:21:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:37,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:37,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:37,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:37,784 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:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:37,819 INFO L93 Difference]: Finished difference Result 3432 states and 6841 transitions. [2022-03-03 18:21:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:37,820 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:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:37,833 INFO L225 Difference]: With dead ends: 3432 [2022-03-03 18:21:37,833 INFO L226 Difference]: Without dead ends: 3432 [2022-03-03 18:21:37,833 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:37,834 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:37,835 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:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-03-03 18:21:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2359. [2022-03-03 18:21:37,934 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:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4695 transitions. [2022-03-03 18:21:37,943 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4695 transitions. Word has length 36 [2022-03-03 18:21:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:37,943 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 4695 transitions. [2022-03-03 18:21:37,944 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:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4695 transitions. [2022-03-03 18:21:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-03 18:21:37,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:37,947 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:37,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:38,170 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:38,171 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:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -877434549, now seen corresponding path program 1 times [2022-03-03 18:21:38,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:38,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939296030] [2022-03-03 18:21:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:38,263 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:38,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:38,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939296030] [2022-03-03 18:21:38,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939296030] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:38,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331910426] [2022-03-03 18:21:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:38,270 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:38,271 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:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:38,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 18:21:38,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:38,484 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:38,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:38,586 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:38,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331910426] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:38,586 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:38,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 18:21:38,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894200666] [2022-03-03 18:21:38,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:38,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:38,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:38,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 18:21:38,595 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:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:38,679 INFO L93 Difference]: Finished difference Result 2369 states and 4705 transitions. [2022-03-03 18:21:38,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:21:38,680 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:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:38,689 INFO L225 Difference]: With dead ends: 2369 [2022-03-03 18:21:38,689 INFO L226 Difference]: Without dead ends: 2369 [2022-03-03 18:21:38,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-03 18:21:38,694 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:38,698 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:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-03-03 18:21:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2022-03-03 18:21:38,741 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:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4705 transitions. [2022-03-03 18:21:38,749 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4705 transitions. Word has length 40 [2022-03-03 18:21:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:38,750 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 4705 transitions. [2022-03-03 18:21:38,750 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:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4705 transitions. [2022-03-03 18:21:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-03 18:21:38,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:38,751 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:38,776 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:38,975 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:38,975 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:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash -198306197, now seen corresponding path program 2 times [2022-03-03 18:21:38,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:38,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006267134] [2022-03-03 18:21:38,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:39,096 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:39,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:39,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006267134] [2022-03-03 18:21:39,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006267134] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:39,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900325768] [2022-03-03 18:21:39,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:39,101 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:39,102 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:39,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:39,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:39,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-03 18:21:39,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:39,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:39,309 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-03 18:21:39,310 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:39,357 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-03 18:21:39,357 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:39,427 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-03 18:21:39,428 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:39,451 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:39,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:39,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900325768] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:39,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:39,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-03 18:21:39,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733469299] [2022-03-03 18:21:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:39,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:39,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-03 18:21:39,453 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:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:39,676 INFO L93 Difference]: Finished difference Result 2638 states and 5243 transitions. [2022-03-03 18:21:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:39,676 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:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:39,687 INFO L225 Difference]: With dead ends: 2638 [2022-03-03 18:21:39,687 INFO L226 Difference]: Without dead ends: 2638 [2022-03-03 18:21:39,687 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:39,688 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 124 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:39,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 479 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:21:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2022-03-03 18:21:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2502. [2022-03-03 18:21:39,737 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:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4971 transitions. [2022-03-03 18:21:39,744 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4971 transitions. Word has length 50 [2022-03-03 18:21:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:39,744 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 4971 transitions. [2022-03-03 18:21:39,744 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:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4971 transitions. [2022-03-03 18:21:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-03 18:21:39,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:39,746 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:39,772 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:39,959 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:39,959 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:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 697598481, now seen corresponding path program 1 times [2022-03-03 18:21:39,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:39,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123480049] [2022-03-03 18:21:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:40,062 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:40,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:40,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123480049] [2022-03-03 18:21:40,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123480049] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:40,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308781106] [2022-03-03 18:21:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:40,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:40,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:40,064 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:40,068 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:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:40,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 18:21:40,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:40,249 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:40,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:40,385 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:40,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308781106] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:40,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:40,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 18:21:40,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587558893] [2022-03-03 18:21:40,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:40,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 18:21:40,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 18:21:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:40,387 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:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:40,572 INFO L93 Difference]: Finished difference Result 2522 states and 4991 transitions. [2022-03-03 18:21:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:21:40,572 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:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:40,582 INFO L225 Difference]: With dead ends: 2522 [2022-03-03 18:21:40,582 INFO L226 Difference]: Without dead ends: 2522 [2022-03-03 18:21:40,583 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:40,584 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.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:40,584 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.1s Time] [2022-03-03 18:21:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-03-03 18:21:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2022-03-03 18:21:40,624 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:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4991 transitions. [2022-03-03 18:21:40,654 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4991 transitions. Word has length 50 [2022-03-03 18:21:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:40,655 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4991 transitions. [2022-03-03 18:21:40,655 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:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4991 transitions. [2022-03-03 18:21:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-03 18:21:40,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:40,656 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:40,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-03 18:21:40,867 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:40,867 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:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1015929775, now seen corresponding path program 2 times [2022-03-03 18:21:40,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:40,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29916505] [2022-03-03 18:21:40,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:40,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:41,063 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:41,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:41,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29916505] [2022-03-03 18:21:41,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29916505] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:41,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827926186] [2022-03-03 18:21:41,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:41,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:41,065 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:41,067 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:41,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:41,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:41,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-03 18:21:41,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:41,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:41,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,354 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:41,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,393 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:21:41,393 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:41,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:21:41,434 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:21:41,434 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:41,464 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:41,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:41,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827926186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:41,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:41,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-03 18:21:41,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756498762] [2022-03-03 18:21:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:41,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:41,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:21:41,466 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:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:42,052 INFO L93 Difference]: Finished difference Result 5451 states and 10849 transitions. [2022-03-03 18:21:42,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:21:42,052 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:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:42,074 INFO L225 Difference]: With dead ends: 5451 [2022-03-03 18:21:42,074 INFO L226 Difference]: Without dead ends: 5451 [2022-03-03 18:21:42,074 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:42,091 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:42,091 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:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2022-03-03 18:21:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 3341. [2022-03-03 18:21:42,175 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:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 6629 transitions. [2022-03-03 18:21:42,185 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 6629 transitions. Word has length 70 [2022-03-03 18:21:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:42,185 INFO L470 AbstractCegarLoop]: Abstraction has 3341 states and 6629 transitions. [2022-03-03 18:21:42,186 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:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 6629 transitions. [2022-03-03 18:21:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-03 18:21:42,187 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:42,187 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:42,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:42,412 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:42,412 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:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash -177478757, now seen corresponding path program 1 times [2022-03-03 18:21:42,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:42,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018363084] [2022-03-03 18:21:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:42,613 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:42,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:42,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018363084] [2022-03-03 18:21:42,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018363084] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:42,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555798713] [2022-03-03 18:21:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:42,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:42,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:42,615 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:42,617 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:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:42,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-03 18:21:42,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:42,910 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:42,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:21:43,115 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:43,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555798713] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:21:43,116 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:21:43,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-03 18:21:43,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080707426] [2022-03-03 18:21:43,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:21:43,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-03 18:21:43,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-03 18:21:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:43,118 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:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:43,406 INFO L93 Difference]: Finished difference Result 3356 states and 6644 transitions. [2022-03-03 18:21:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:21:43,407 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:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:43,428 INFO L225 Difference]: With dead ends: 3356 [2022-03-03 18:21:43,428 INFO L226 Difference]: Without dead ends: 3356 [2022-03-03 18:21:43,429 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:43,429 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 40 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:43,430 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:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2022-03-03 18:21:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3356. [2022-03-03 18:21:43,482 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:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 6644 transitions. [2022-03-03 18:21:43,491 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 6644 transitions. Word has length 78 [2022-03-03 18:21:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:43,491 INFO L470 AbstractCegarLoop]: Abstraction has 3356 states and 6644 transitions. [2022-03-03 18:21:43,492 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:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 6644 transitions. [2022-03-03 18:21:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-03 18:21:43,493 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:43,493 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:43,523 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:43,717 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:43,717 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:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 26007824, now seen corresponding path program 2 times [2022-03-03 18:21:43,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:43,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106250950] [2022-03-03 18:21:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:43,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:43,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106250950] [2022-03-03 18:21:43,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106250950] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:43,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:43,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:43,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548245760] [2022-03-03 18:21:43,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:43,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:43,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:43,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:43,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:43,852 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:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:43,993 INFO L93 Difference]: Finished difference Result 3594 states and 7120 transitions. [2022-03-03 18:21:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:43,994 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:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:44,002 INFO L225 Difference]: With dead ends: 3594 [2022-03-03 18:21:44,002 INFO L226 Difference]: Without dead ends: 3594 [2022-03-03 18:21:44,002 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:44,003 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:44,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 398 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:21:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-03-03 18:21:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3480. [2022-03-03 18:21:44,056 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:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6892 transitions. [2022-03-03 18:21:44,064 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6892 transitions. Word has length 93 [2022-03-03 18:21:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:44,064 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 6892 transitions. [2022-03-03 18:21:44,064 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:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6892 transitions. [2022-03-03 18:21:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-03 18:21:44,065 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:44,066 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:44,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 18:21:44,066 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:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 360970443, now seen corresponding path program 1 times [2022-03-03 18:21:44,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:44,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68204012] [2022-03-03 18:21:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:44,150 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,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:44,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68204012] [2022-03-03 18:21:44,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68204012] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:44,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:44,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:44,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634793804] [2022-03-03 18:21:44,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:44,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:44,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:44,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:44,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:44,153 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:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:44,413 INFO L93 Difference]: Finished difference Result 3912 states and 7756 transitions. [2022-03-03 18:21:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:44,419 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:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:44,431 INFO L225 Difference]: With dead ends: 3912 [2022-03-03 18:21:44,431 INFO L226 Difference]: Without dead ends: 3912 [2022-03-03 18:21:44,431 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:44,432 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:44,433 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:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2022-03-03 18:21:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3714. [2022-03-03 18:21:44,493 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:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 7360 transitions. [2022-03-03 18:21:44,501 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 7360 transitions. Word has length 93 [2022-03-03 18:21:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:44,502 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 7360 transitions. [2022-03-03 18:21:44,502 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:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 7360 transitions. [2022-03-03 18:21:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:44,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:44,505 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,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 18:21:44,506 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:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1199640953, now seen corresponding path program 1 times [2022-03-03 18:21:44,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:44,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697074027] [2022-03-03 18:21:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:44,959 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:44,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:44,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697074027] [2022-03-03 18:21:44,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697074027] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:44,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686419180] [2022-03-03 18:21:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:44,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:44,961 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:44,985 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:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:45,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:45,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:45,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,522 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,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:45,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686419180] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:45,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:45,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-03 18:21:45,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173989533] [2022-03-03 18:21:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:45,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:45,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:45,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:21:45,525 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:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:46,038 INFO L93 Difference]: Finished difference Result 8247 states and 16407 transitions. [2022-03-03 18:21:46,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:21:46,038 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,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:46,056 INFO L225 Difference]: With dead ends: 8247 [2022-03-03 18:21:46,056 INFO L226 Difference]: Without dead ends: 8247 [2022-03-03 18:21:46,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 18:21:46,057 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 635 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:46,057 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:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2022-03-03 18:21:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 3900. [2022-03-03 18:21:46,136 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:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 7713 transitions. [2022-03-03 18:21:46,144 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 7713 transitions. Word has length 105 [2022-03-03 18:21:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:46,144 INFO L470 AbstractCegarLoop]: Abstraction has 3900 states and 7713 transitions. [2022-03-03 18:21:46,145 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,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 7713 transitions. [2022-03-03 18:21:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:46,147 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:46,147 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,170 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:46,360 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:46,361 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:46,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash -509932149, now seen corresponding path program 1 times [2022-03-03 18:21:46,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:46,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804690201] [2022-03-03 18:21:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:46,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:46,666 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,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:46,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804690201] [2022-03-03 18:21:46,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804690201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:46,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623354582] [2022-03-03 18:21:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:46,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:46,668 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:46,696 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:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:46,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:46,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:47,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:47,126 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,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:47,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623354582] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:47,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:47,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:21:47,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685201671] [2022-03-03 18:21:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:47,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:47,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:47,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:47,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:21:47,128 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:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:47,728 INFO L93 Difference]: Finished difference Result 9773 states and 19440 transitions. [2022-03-03 18:21:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:21:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:47,752 INFO L225 Difference]: With dead ends: 9773 [2022-03-03 18:21:47,752 INFO L226 Difference]: Without dead ends: 9773 [2022-03-03 18:21:47,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:21:47,753 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 827 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:47,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1345 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:21:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2022-03-03 18:21:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 3903. [2022-03-03 18:21:47,861 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:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 7719 transitions. [2022-03-03 18:21:47,871 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 7719 transitions. Word has length 105 [2022-03-03 18:21:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:47,871 INFO L470 AbstractCegarLoop]: Abstraction has 3903 states and 7719 transitions. [2022-03-03 18:21:47,872 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:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 7719 transitions. [2022-03-03 18:21:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:47,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:47,874 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:47,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:48,100 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:48,101 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:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1481321675, now seen corresponding path program 2 times [2022-03-03 18:21:48,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:48,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664018634] [2022-03-03 18:21:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:48,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:48,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664018634] [2022-03-03 18:21:48,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664018634] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:48,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770308296] [2022-03-03 18:21:48,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:21:48,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:48,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:48,322 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:48,355 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:48,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:21:48,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:48,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:48,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:48,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:48,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:48,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770308296] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:48,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:48,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:21:48,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537502310] [2022-03-03 18:21:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:48,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:48,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:21:48,785 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:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:49,638 INFO L93 Difference]: Finished difference Result 10247 states and 20388 transitions. [2022-03-03 18:21:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:21:49,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:49,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:49,663 INFO L225 Difference]: With dead ends: 10247 [2022-03-03 18:21:49,664 INFO L226 Difference]: Without dead ends: 10247 [2022-03-03 18:21:49,664 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:49,666 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1057 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:49,666 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.5s Time] [2022-03-03 18:21:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-03-03 18:21:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 3905. [2022-03-03 18:21:49,775 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:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 7723 transitions. [2022-03-03 18:21:49,782 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 7723 transitions. Word has length 105 [2022-03-03 18:21:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:49,782 INFO L470 AbstractCegarLoop]: Abstraction has 3905 states and 7723 transitions. [2022-03-03 18:21:49,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 7723 transitions. [2022-03-03 18:21:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:49,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:49,785 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:49,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-03 18:21:49,999 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:49,999 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:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash 428011595, now seen corresponding path program 3 times [2022-03-03 18:21:50,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:50,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789609157] [2022-03-03 18:21:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:50,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:50,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789609157] [2022-03-03 18:21:50,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789609157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:50,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157362874] [2022-03-03 18:21:50,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:21:50,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:50,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:50,140 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:50,142 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:50,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:21:50,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:50,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:50,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:50,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:50,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:50,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157362874] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:50,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:50,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:21:50,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980481611] [2022-03-03 18:21:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:50,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:50,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:50,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:21:50,638 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:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:51,828 INFO L93 Difference]: Finished difference Result 9750 states and 19370 transitions. [2022-03-03 18:21:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:21:51,829 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,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:51,846 INFO L225 Difference]: With dead ends: 9750 [2022-03-03 18:21:51,846 INFO L226 Difference]: Without dead ends: 9750 [2022-03-03 18:21:51,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:21:51,847 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:51,848 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:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2022-03-03 18:21:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 3925. [2022-03-03 18:21:51,933 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:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 7744 transitions. [2022-03-03 18:21:51,939 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 7744 transitions. Word has length 105 [2022-03-03 18:21:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:51,940 INFO L470 AbstractCegarLoop]: Abstraction has 3925 states and 7744 transitions. [2022-03-03 18:21:51,940 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,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 7744 transitions. [2022-03-03 18:21:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:51,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:51,942 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:51,966 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:52,155 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:52,155 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:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2091661697, now seen corresponding path program 4 times [2022-03-03 18:21:52,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:52,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440579433] [2022-03-03 18:21:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:52,478 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:52,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:52,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440579433] [2022-03-03 18:21:52,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440579433] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:52,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414704844] [2022-03-03 18:21:52,479 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:21:52,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:52,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:52,484 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:52,509 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:52,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:21:52,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:52,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:52,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:52,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:52,976 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,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:52,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414704844] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:52,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:52,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:52,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627181044] [2022-03-03 18:21:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:52,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:52,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:52,978 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:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:54,435 INFO L93 Difference]: Finished difference Result 13148 states and 26142 transitions. [2022-03-03 18:21:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:21:54,435 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:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:54,452 INFO L225 Difference]: With dead ends: 13148 [2022-03-03 18:21:54,452 INFO L226 Difference]: Without dead ends: 13148 [2022-03-03 18:21:54,453 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:54,454 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.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:54,454 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.7s Time] [2022-03-03 18:21:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13148 states. [2022-03-03 18:21:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13148 to 3975. [2022-03-03 18:21:54,566 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:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-03 18:21:54,572 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-03 18:21:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:54,572 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-03 18:21:54,573 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:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-03 18:21:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:54,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:54,575 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:54,597 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:54,797 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:54,798 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:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1656374657, now seen corresponding path program 5 times [2022-03-03 18:21:54,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:54,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071009651] [2022-03-03 18:21:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:21:55,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:55,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071009651] [2022-03-03 18:21:55,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071009651] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:55,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518583967] [2022-03-03 18:21:55,116 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:21:55,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:55,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:55,120 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:55,122 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:55,255 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:21:55,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:55,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:55,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:55,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:55,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:55,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518583967] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:55,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:55,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:55,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195859316] [2022-03-03 18:21:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:55,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:55,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:55,593 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:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:56,367 INFO L93 Difference]: Finished difference Result 12864 states and 25565 transitions. [2022-03-03 18:21:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:21:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:21:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:56,384 INFO L225 Difference]: With dead ends: 12864 [2022-03-03 18:21:56,384 INFO L226 Difference]: Without dead ends: 12864 [2022-03-03 18:21:56,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 18:21:56,385 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.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:56,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 1809 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:21:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2022-03-03 18:21:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 3977. [2022-03-03 18:21:56,525 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:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 7848 transitions. [2022-03-03 18:21:56,534 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 7848 transitions. Word has length 105 [2022-03-03 18:21:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:56,534 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 7848 transitions. [2022-03-03 18:21:56,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 7848 transitions. [2022-03-03 18:21:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:56,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:56,537 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:56,565 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:56,763 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:56,763 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:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1169892031, now seen corresponding path program 6 times [2022-03-03 18:21:56,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:56,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579907623] [2022-03-03 18:21:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:57,036 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,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:57,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579907623] [2022-03-03 18:21:57,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579907623] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:57,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182846476] [2022-03-03 18:21:57,037 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:21:57,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:57,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:57,038 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:57,039 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:57,152 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:21:57,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:21:57,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:57,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:57,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:21:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:21:57,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:57,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182846476] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:57,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:57,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:57,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761971238] [2022-03-03 18:21:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:57,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:57,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:57,543 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:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:58,789 INFO L93 Difference]: Finished difference Result 13826 states and 27441 transitions. [2022-03-03 18:21:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:21:58,791 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,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:58,813 INFO L225 Difference]: With dead ends: 13826 [2022-03-03 18:21:58,813 INFO L226 Difference]: Without dead ends: 13826 [2022-03-03 18:21:58,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=1894, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 18:21:58,816 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:58,816 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:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-03-03 18:21:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 3975. [2022-03-03 18:21:58,914 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:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-03 18:21:58,920 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-03 18:21:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:58,921 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-03 18:21:58,921 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,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-03 18:21:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:21:58,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:58,923 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,949 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:59,147 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:59,147 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:59,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1363632863, now seen corresponding path program 7 times [2022-03-03 18:21:59,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:59,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112901685] [2022-03-03 18:21:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:59,415 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,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:59,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112901685] [2022-03-03 18:21:59,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112901685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:21:59,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520186491] [2022-03-03 18:21:59,416 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:21:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:21:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:21:59,420 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:59,443 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:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:59,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:21:59,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:21:59,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,924 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,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:21:59,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520186491] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:59,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:21:59,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:21:59,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982723681] [2022-03-03 18:21:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:59,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:21:59,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:59,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:21:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:21:59,926 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:22:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:00,446 INFO L93 Difference]: Finished difference Result 11072 states and 21976 transitions. [2022-03-03 18:22:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:22:00,446 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,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:00,460 INFO L225 Difference]: With dead ends: 11072 [2022-03-03 18:22:00,460 INFO L226 Difference]: Without dead ends: 11072 [2022-03-03 18:22:00,461 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:22:00,461 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:22:00,461 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:22:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2022-03-03 18:22:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 3978. [2022-03-03 18:22:00,533 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:22:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 7850 transitions. [2022-03-03 18:22:00,539 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 7850 transitions. Word has length 105 [2022-03-03 18:22:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:00,540 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 7850 transitions. [2022-03-03 18:22:00,540 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,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 7850 transitions. [2022-03-03 18:22:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:00,542 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:00,542 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,566 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:22:00,755 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:22:00,755 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:22:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -61562595, now seen corresponding path program 8 times [2022-03-03 18:22:00,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:00,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981745831] [2022-03-03 18:22:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:01,026 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,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:01,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981745831] [2022-03-03 18:22:01,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981745831] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:01,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905009967] [2022-03-03 18:22:01,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:01,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:01,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:01,028 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:22:01,030 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:22:01,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:01,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:01,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:01,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:01,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:01,508 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,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:01,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905009967] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:01,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:01,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:01,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439859040] [2022-03-03 18:22:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:01,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:01,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:01,509 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:22:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:02,302 INFO L93 Difference]: Finished difference Result 12770 states and 25348 transitions. [2022-03-03 18:22:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:22:02,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:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:02,342 INFO L225 Difference]: With dead ends: 12770 [2022-03-03 18:22:02,342 INFO L226 Difference]: Without dead ends: 12770 [2022-03-03 18:22:02,343 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:22:02,343 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 931 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:02,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 1833 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:22:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2022-03-03 18:22:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 3980. [2022-03-03 18:22:02,416 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:22:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 7854 transitions. [2022-03-03 18:22:02,420 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 7854 transitions. Word has length 105 [2022-03-03 18:22:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:02,421 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 7854 transitions. [2022-03-03 18:22:02,421 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:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 7854 transitions. [2022-03-03 18:22:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:02,423 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:02,423 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,445 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:22:02,637 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:22:02,638 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:22:02,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1114872675, now seen corresponding path program 9 times [2022-03-03 18:22:02,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:02,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111435538] [2022-03-03 18:22:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:02,865 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,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:02,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111435538] [2022-03-03 18:22:02,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111435538] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:02,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292769200] [2022-03-03 18:22:02,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:02,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:02,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:02,867 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:22:02,894 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:22:03,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:03,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:03,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:03,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:03,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,318 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,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:03,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292769200] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:03,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:03,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:03,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020481526] [2022-03-03 18:22:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:03,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:03,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:03,320 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:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:04,447 INFO L93 Difference]: Finished difference Result 12273 states and 24330 transitions. [2022-03-03 18:22:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:04,448 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,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:04,462 INFO L225 Difference]: With dead ends: 12273 [2022-03-03 18:22:04,462 INFO L226 Difference]: Without dead ends: 12273 [2022-03-03 18:22:04,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:22:04,464 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 1214 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:04,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1939 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:22:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2022-03-03 18:22:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 3975. [2022-03-03 18:22:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-03 18:22:04,560 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-03 18:22:04,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:04,561 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-03 18:22:04,561 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,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-03 18:22:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:04,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:04,564 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,587 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:04,779 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:04,780 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:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1959628071, now seen corresponding path program 10 times [2022-03-03 18:22:04,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:04,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050447950] [2022-03-03 18:22:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:05,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:05,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050447950] [2022-03-03 18:22:05,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050447950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:05,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200627837] [2022-03-03 18:22:05,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:05,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:05,073 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:05,074 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:05,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:05,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:05,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:05,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:05,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,547 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,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:05,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200627837] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:05,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:05,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-03 18:22:05,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577308791] [2022-03-03 18:22:05,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:05,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:05,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:05,549 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:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:06,189 INFO L93 Difference]: Finished difference Result 9102 states and 18079 transitions. [2022-03-03 18:22:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:22:06,189 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:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:06,200 INFO L225 Difference]: With dead ends: 9102 [2022-03-03 18:22:06,200 INFO L226 Difference]: Without dead ends: 9102 [2022-03-03 18:22:06,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 18:22:06,201 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 747 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:06,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 1269 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:22:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2022-03-03 18:22:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 4050. [2022-03-03 18:22:06,259 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:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:06,263 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:06,263 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:06,263 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:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:06,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:06,265 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,288 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:06,486 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:06,486 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:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2128369343, now seen corresponding path program 11 times [2022-03-03 18:22:06,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:06,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538448008] [2022-03-03 18:22:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:06,810 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,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:06,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538448008] [2022-03-03 18:22:06,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538448008] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:06,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272706151] [2022-03-03 18:22:06,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:06,812 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:06,814 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:06,980 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:06,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:06,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:06,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:07,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,297 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:07,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:07,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272706151] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:07,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:07,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:07,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726628913] [2022-03-03 18:22:07,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:07,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:07,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:07,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:07,299 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:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:08,261 INFO L93 Difference]: Finished difference Result 10156 states and 20144 transitions. [2022-03-03 18:22:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:08,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:08,273 INFO L225 Difference]: With dead ends: 10156 [2022-03-03 18:22:08,273 INFO L226 Difference]: Without dead ends: 10156 [2022-03-03 18:22:08,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:08,274 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.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:08,274 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.5s Time] [2022-03-03 18:22:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2022-03-03 18:22:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 4050. [2022-03-03 18:22:08,333 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:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:08,340 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:08,340 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:08,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:08,343 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:08,343 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:08,367 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:08,567 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:08,567 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:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash -16501203, now seen corresponding path program 12 times [2022-03-03 18:22:08,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:08,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193392655] [2022-03-03 18:22:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:08,759 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,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:08,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193392655] [2022-03-03 18:22:08,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193392655] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:08,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126919003] [2022-03-03 18:22:08,759 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:08,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:08,764 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:08,791 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:08,915 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:08,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:08,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:08,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:09,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:09,261 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:09,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:09,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126919003] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:09,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:09,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:09,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259513583] [2022-03-03 18:22:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:09,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:09,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:09,263 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:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:10,345 INFO L93 Difference]: Finished difference Result 14218 states and 28225 transitions. [2022-03-03 18:22:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:10,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:10,366 INFO L225 Difference]: With dead ends: 14218 [2022-03-03 18:22:10,366 INFO L226 Difference]: Without dead ends: 14218 [2022-03-03 18:22:10,367 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:10,367 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:10,367 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:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2022-03-03 18:22:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 4054. [2022-03-03 18:22:10,476 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:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 8002 transitions. [2022-03-03 18:22:10,480 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 8002 transitions. Word has length 105 [2022-03-03 18:22:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:10,481 INFO L470 AbstractCegarLoop]: Abstraction has 4054 states and 8002 transitions. [2022-03-03 18:22:10,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 8002 transitions. [2022-03-03 18:22:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:10,482 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:10,482 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:10,499 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:10,682 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:10,683 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:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash -563432145, now seen corresponding path program 13 times [2022-03-03 18:22:10,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:10,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923242199] [2022-03-03 18:22:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:10,855 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,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:10,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923242199] [2022-03-03 18:22:10,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923242199] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:10,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309359264] [2022-03-03 18:22:10,855 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:10,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:10,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:10,860 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:10,865 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:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:11,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:11,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:11,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:11,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:11,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309359264] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:11,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:11,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:11,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108286852] [2022-03-03 18:22:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:11,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:11,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:11,328 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:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:11,912 INFO L93 Difference]: Finished difference Result 9882 states and 19601 transitions. [2022-03-03 18:22:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:22:11,912 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,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:11,923 INFO L225 Difference]: With dead ends: 9882 [2022-03-03 18:22:11,924 INFO L226 Difference]: Without dead ends: 9882 [2022-03-03 18:22:11,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-03-03 18:22:11,924 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:11,925 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:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9882 states. [2022-03-03 18:22:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9882 to 4056. [2022-03-03 18:22:11,978 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:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-03 18:22:11,982 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-03 18:22:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:11,982 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-03 18:22:11,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-03 18:22:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:11,984 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:11,984 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:12,001 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:12,185 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:12,185 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:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1049914771, now seen corresponding path program 14 times [2022-03-03 18:22:12,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:12,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101110880] [2022-03-03 18:22:12,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:12,465 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,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:12,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101110880] [2022-03-03 18:22:12,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101110880] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:12,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860587900] [2022-03-03 18:22:12,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:12,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:12,467 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:12,468 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:12,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:12,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:12,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:12,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:12,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,963 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,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:12,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860587900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:12,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:12,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:12,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716807406] [2022-03-03 18:22:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:12,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:12,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:12,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:12,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:12,965 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:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:13,990 INFO L93 Difference]: Finished difference Result 10977 states and 21724 transitions. [2022-03-03 18:22:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:13,990 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:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:14,005 INFO L225 Difference]: With dead ends: 10977 [2022-03-03 18:22:14,005 INFO L226 Difference]: Without dead ends: 10977 [2022-03-03 18:22:14,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1456, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:14,006 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1081 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:14,006 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.6s Time] [2022-03-03 18:22:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10977 states. [2022-03-03 18:22:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10977 to 4050. [2022-03-03 18:22:14,064 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:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:14,068 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:14,068 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:14,068 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:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:14,070 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:14,070 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:14,086 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:14,270 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:14,271 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:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash -550224723, now seen corresponding path program 15 times [2022-03-03 18:22:14,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:14,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320039476] [2022-03-03 18:22:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:14,553 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,553 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:14,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320039476] [2022-03-03 18:22:14,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320039476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:14,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486555861] [2022-03-03 18:22:14,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:14,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:14,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:14,556 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:14,581 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:14,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:14,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:14,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:14,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:14,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:15,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:15,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486555861] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:15,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:15,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:15,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686002808] [2022-03-03 18:22:15,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:15,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:15,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:15,041 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:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:16,229 INFO L93 Difference]: Finished difference Result 12897 states and 25597 transitions. [2022-03-03 18:22:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:22:16,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:16,245 INFO L225 Difference]: With dead ends: 12897 [2022-03-03 18:22:16,245 INFO L226 Difference]: Without dead ends: 12897 [2022-03-03 18:22:16,246 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:16,246 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:16,247 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:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2022-03-03 18:22:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 4060. [2022-03-03 18:22:16,315 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:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 8014 transitions. [2022-03-03 18:22:16,319 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 8014 transitions. Word has length 105 [2022-03-03 18:22:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:16,320 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 8014 transitions. [2022-03-03 18:22:16,320 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,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 8014 transitions. [2022-03-03 18:22:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:16,321 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:16,321 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,338 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:16,521 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:16,522 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:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1097155665, now seen corresponding path program 16 times [2022-03-03 18:22:16,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:16,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087321655] [2022-03-03 18:22:16,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:16,789 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,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:16,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087321655] [2022-03-03 18:22:16,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087321655] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:16,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987000724] [2022-03-03 18:22:16,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:16,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:16,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:16,791 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:16,793 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:17,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:17,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:17,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:17,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:17,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:17,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:17,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987000724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:17,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:17,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2022-03-03 18:22:17,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910729215] [2022-03-03 18:22:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:17,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:17,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:22:17,289 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:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:18,258 INFO L93 Difference]: Finished difference Result 16275 states and 32325 transitions. [2022-03-03 18:22:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:22:18,258 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:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:18,280 INFO L225 Difference]: With dead ends: 16275 [2022-03-03 18:22:18,280 INFO L226 Difference]: Without dead ends: 16275 [2022-03-03 18:22:18,281 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:18,281 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 1363 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:18,281 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.7s Time] [2022-03-03 18:22:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2022-03-03 18:22:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 4062. [2022-03-03 18:22:18,372 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:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 8018 transitions. [2022-03-03 18:22:18,376 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 8018 transitions. Word has length 105 [2022-03-03 18:22:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:18,377 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 8018 transitions. [2022-03-03 18:22:18,377 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:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 8018 transitions. [2022-03-03 18:22:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:18,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:18,378 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,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-03 18:22:18,579 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:18,579 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:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1583638291, now seen corresponding path program 17 times [2022-03-03 18:22:18,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:18,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888523066] [2022-03-03 18:22:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:18,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:18,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888523066] [2022-03-03 18:22:18,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888523066] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:18,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97962121] [2022-03-03 18:22:18,830 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:18,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:18,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:18,832 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:18,856 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:19,028 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:19,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:19,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:19,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:19,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,346 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,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:19,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97962121] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:19,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:19,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:19,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985355820] [2022-03-03 18:22:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:19,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:19,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:19,349 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:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:20,586 INFO L93 Difference]: Finished difference Result 13575 states and 26896 transitions. [2022-03-03 18:22:20,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:22:20,587 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,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:20,604 INFO L225 Difference]: With dead ends: 13575 [2022-03-03 18:22:20,605 INFO L226 Difference]: Without dead ends: 13575 [2022-03-03 18:22:20,605 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:20,606 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:20,606 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:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2022-03-03 18:22:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 4056. [2022-03-03 18:22:20,682 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:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-03 18:22:20,686 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-03 18:22:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:20,686 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-03 18:22:20,687 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,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-03 18:22:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:20,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:20,688 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,705 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:20,889 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:20,889 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:20,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1389897459, now seen corresponding path program 18 times [2022-03-03 18:22:20,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:20,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460262098] [2022-03-03 18:22:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:20,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:21,087 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,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:21,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460262098] [2022-03-03 18:22:21,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460262098] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:21,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661566094] [2022-03-03 18:22:21,088 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:21,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:21,089 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:21,090 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:21,257 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:21,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:21,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:21,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:21,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,609 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,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:21,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661566094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:21,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:21,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:21,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668358481] [2022-03-03 18:22:21,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:21,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:21,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:21,612 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:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:22,075 INFO L93 Difference]: Finished difference Result 8414 states and 16665 transitions. [2022-03-03 18:22:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:22,076 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,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:22,087 INFO L225 Difference]: With dead ends: 8414 [2022-03-03 18:22:22,087 INFO L226 Difference]: Without dead ends: 8414 [2022-03-03 18:22:22,088 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:22,088 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 642 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:22,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 1493 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:22:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2022-03-03 18:22:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 4059. [2022-03-03 18:22:22,149 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:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 8012 transitions. [2022-03-03 18:22:22,154 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 8012 transitions. Word has length 105 [2022-03-03 18:22:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:22,154 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 8012 transitions. [2022-03-03 18:22:22,154 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,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 8012 transitions. [2022-03-03 18:22:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:22,155 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:22,156 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,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-03 18:22:22,356 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:22,356 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:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1479874379, now seen corresponding path program 19 times [2022-03-03 18:22:22,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:22,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497092194] [2022-03-03 18:22:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:22,611 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,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:22,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497092194] [2022-03-03 18:22:22,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497092194] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:22,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374799619] [2022-03-03 18:22:22,612 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:22,616 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:22,641 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:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:22,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:22,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:23,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,079 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:23,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:23,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374799619] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:23,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:23,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:23,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820105778] [2022-03-03 18:22:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:23,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:23,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:23,080 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:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:23,766 INFO L93 Difference]: Finished difference Result 10112 states and 20037 transitions. [2022-03-03 18:22:23,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:22:23,767 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:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:23,779 INFO L225 Difference]: With dead ends: 10112 [2022-03-03 18:22:23,779 INFO L226 Difference]: Without dead ends: 10112 [2022-03-03 18:22:23,779 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:23,780 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:23,780 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:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2022-03-03 18:22:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 4061. [2022-03-03 18:22:23,847 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:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 8016 transitions. [2022-03-03 18:22:23,853 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 8016 transitions. Word has length 105 [2022-03-03 18:22:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:23,853 INFO L470 AbstractCegarLoop]: Abstraction has 4061 states and 8016 transitions. [2022-03-03 18:22:23,853 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:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 8016 transitions. [2022-03-03 18:22:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:23,856 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:23,856 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:23,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-03 18:22:24,058 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:24,059 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:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 426564299, now seen corresponding path program 20 times [2022-03-03 18:22:24,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:24,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948805562] [2022-03-03 18:22:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:24,314 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,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:24,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948805562] [2022-03-03 18:22:24,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948805562] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:24,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130153406] [2022-03-03 18:22:24,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:24,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:24,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:24,320 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:24,322 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:24,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:24,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:24,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:24,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:24,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:24,797 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:24,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:24,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130153406] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:24,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:24,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:24,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421735425] [2022-03-03 18:22:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:24,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:24,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:24,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:24,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:24,799 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:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:25,871 INFO L93 Difference]: Finished difference Result 9615 states and 19019 transitions. [2022-03-03 18:22:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:22:25,872 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:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:25,883 INFO L225 Difference]: With dead ends: 9615 [2022-03-03 18:22:25,884 INFO L226 Difference]: Without dead ends: 9615 [2022-03-03 18:22:25,884 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:25,885 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:25,885 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:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2022-03-03 18:22:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 4050. [2022-03-03 18:22:25,975 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:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-03 18:22:25,980 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-03 18:22:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:25,980 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-03 18:22:25,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-03 18:22:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:25,982 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:25,982 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:25,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-03 18:22:26,182 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:26,183 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:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2124234257, now seen corresponding path program 21 times [2022-03-03 18:22:26,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:26,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836901042] [2022-03-03 18:22:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:26,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:26,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836901042] [2022-03-03 18:22:26,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836901042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:26,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061947530] [2022-03-03 18:22:26,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:26,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:26,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:26,411 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:26,413 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:26,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:26,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:26,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:26,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:26,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:26,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:26,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:26,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061947530] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:26,903 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:26,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:26,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84584912] [2022-03-03 18:22:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:26,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:26,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:26,904 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:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:27,472 INFO L93 Difference]: Finished difference Result 7878 states and 15626 transitions. [2022-03-03 18:22:27,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:27,476 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,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:27,485 INFO L225 Difference]: With dead ends: 7878 [2022-03-03 18:22:27,486 INFO L226 Difference]: Without dead ends: 7878 [2022-03-03 18:22:27,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:27,491 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 827 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:27,491 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:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-03-03 18:22:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4086. [2022-03-03 18:22:27,542 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:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-03 18:22:27,546 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-03 18:22:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:27,546 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-03 18:22:27,546 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,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-03 18:22:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:27,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:27,548 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,564 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:27,748 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:27,748 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:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1798897081, now seen corresponding path program 22 times [2022-03-03 18:22:27,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:27,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129130915] [2022-03-03 18:22:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:28,038 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,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:28,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129130915] [2022-03-03 18:22:28,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129130915] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:28,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492242676] [2022-03-03 18:22:28,039 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:28,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:28,040 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:28,043 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:28,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:28,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:28,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:28,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:28,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:28,493 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,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:28,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492242676] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:28,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:28,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-03 18:22:28,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314029997] [2022-03-03 18:22:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:28,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:28,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:28,494 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:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:29,438 INFO L93 Difference]: Finished difference Result 9039 states and 17934 transitions. [2022-03-03 18:22:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:22:29,438 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:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:29,448 INFO L225 Difference]: With dead ends: 9039 [2022-03-03 18:22:29,448 INFO L226 Difference]: Without dead ends: 9039 [2022-03-03 18:22:29,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:22:29,449 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 1028 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:29,450 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.7s Time] [2022-03-03 18:22:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2022-03-03 18:22:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 4089. [2022-03-03 18:22:29,506 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:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 8072 transitions. [2022-03-03 18:22:29,511 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 8072 transitions. Word has length 105 [2022-03-03 18:22:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:29,511 INFO L470 AbstractCegarLoop]: Abstraction has 4089 states and 8072 transitions. [2022-03-03 18:22:29,511 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:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 8072 transitions. [2022-03-03 18:22:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:29,512 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:29,513 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,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-03 18:22:29,713 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:29,713 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:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2005866963, now seen corresponding path program 23 times [2022-03-03 18:22:29,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:29,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826366403] [2022-03-03 18:22:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:29,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:29,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826366403] [2022-03-03 18:22:29,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826366403] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:29,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045492595] [2022-03-03 18:22:29,966 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:29,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:29,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:29,972 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:29,973 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:30,173 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:30,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:30,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:30,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:30,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,480 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,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:30,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045492595] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:30,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:30,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:30,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329952067] [2022-03-03 18:22:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:30,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:30,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:30,481 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:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:31,716 INFO L93 Difference]: Finished difference Result 9474 states and 18775 transitions. [2022-03-03 18:22:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:31,716 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,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:31,726 INFO L225 Difference]: With dead ends: 9474 [2022-03-03 18:22:31,727 INFO L226 Difference]: Without dead ends: 9474 [2022-03-03 18:22:31,727 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:31,728 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:31,728 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:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states. [2022-03-03 18:22:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 4086. [2022-03-03 18:22:31,775 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:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-03 18:22:31,779 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-03 18:22:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:31,780 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-03 18:22:31,780 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,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-03 18:22:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:31,781 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:31,781 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,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-03 18:22:31,986 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:31,987 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:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2128263501, now seen corresponding path program 24 times [2022-03-03 18:22:31,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:31,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512604388] [2022-03-03 18:22:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:32,196 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,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:32,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512604388] [2022-03-03 18:22:32,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512604388] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:32,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216234711] [2022-03-03 18:22:32,197 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:32,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:32,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:32,198 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:32,199 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:32,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:32,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:32,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:32,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:32,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,783 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:32,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:32,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216234711] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:32,784 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:32,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:32,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630309400] [2022-03-03 18:22:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:32,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:32,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:32,785 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:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:33,300 INFO L93 Difference]: Finished difference Result 8122 states and 16081 transitions. [2022-03-03 18:22:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:22:33,300 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,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:33,308 INFO L225 Difference]: With dead ends: 8122 [2022-03-03 18:22:33,308 INFO L226 Difference]: Without dead ends: 8122 [2022-03-03 18:22:33,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:22:33,309 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:33,309 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:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2022-03-03 18:22:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4095. [2022-03-03 18:22:33,373 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:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 8084 transitions. [2022-03-03 18:22:33,378 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 8084 transitions. Word has length 105 [2022-03-03 18:22:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:33,378 INFO L470 AbstractCegarLoop]: Abstraction has 4095 states and 8084 transitions. [2022-03-03 18:22:33,378 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,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 8084 transitions. [2022-03-03 18:22:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:33,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:33,379 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,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-03 18:22:33,580 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:33,580 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:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1959733913, now seen corresponding path program 25 times [2022-03-03 18:22:33,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:33,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314934232] [2022-03-03 18:22:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:33,702 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:33,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:33,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314934232] [2022-03-03 18:22:33,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314934232] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:33,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160451136] [2022-03-03 18:22:33,703 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:33,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:33,704 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:33,706 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:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:33,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:33,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:34,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,235 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,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:34,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160451136] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:34,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:34,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:34,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324170138] [2022-03-03 18:22:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:34,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:34,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:34,236 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:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:35,384 INFO L93 Difference]: Finished difference Result 11081 states and 21956 transitions. [2022-03-03 18:22:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:35,384 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:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:35,399 INFO L225 Difference]: With dead ends: 11081 [2022-03-03 18:22:35,400 INFO L226 Difference]: Without dead ends: 11081 [2022-03-03 18:22:35,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:22:35,401 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:35,401 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:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11081 states. [2022-03-03 18:22:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11081 to 4092. [2022-03-03 18:22:35,459 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:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-03 18:22:35,468 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-03 18:22:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:35,468 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-03 18:22:35,469 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:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-03 18:22:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:35,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:35,471 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,495 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:35,694 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:35,695 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:35,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash -185136633, now seen corresponding path program 26 times [2022-03-03 18:22:35,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:35,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495175876] [2022-03-03 18:22:35,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:35,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:35,843 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,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:35,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495175876] [2022-03-03 18:22:35,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495175876] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:35,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591549335] [2022-03-03 18:22:35,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:35,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:35,845 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:35,846 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:36,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:36,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:36,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:36,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:36,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,374 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:36,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:36,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591549335] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:36,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:36,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:36,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068512819] [2022-03-03 18:22:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:36,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:36,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:36,376 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:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:37,574 INFO L93 Difference]: Finished difference Result 13372 states and 26547 transitions. [2022-03-03 18:22:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 18:22:37,574 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,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:37,593 INFO L225 Difference]: With dead ends: 13372 [2022-03-03 18:22:37,593 INFO L226 Difference]: Without dead ends: 13372 [2022-03-03 18:22:37,594 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:37,594 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:37,594 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:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2022-03-03 18:22:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 4096. [2022-03-03 18:22:37,667 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:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 8086 transitions. [2022-03-03 18:22:37,671 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 8086 transitions. Word has length 105 [2022-03-03 18:22:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:37,672 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 8086 transitions. [2022-03-03 18:22:37,672 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,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 8086 transitions. [2022-03-03 18:22:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:37,673 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:37,673 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,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-03 18:22:37,874 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:37,874 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:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -732067575, now seen corresponding path program 27 times [2022-03-03 18:22:37,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:37,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601194858] [2022-03-03 18:22:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:38,149 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:38,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:38,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601194858] [2022-03-03 18:22:38,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601194858] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:38,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670247430] [2022-03-03 18:22:38,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:38,152 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:38,177 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:38,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:38,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:38,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:38,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:38,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:38,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:38,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670247430] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:38,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:38,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:38,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841050175] [2022-03-03 18:22:38,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:38,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:38,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:38,676 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:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:39,447 INFO L93 Difference]: Finished difference Result 9134 states and 18105 transitions. [2022-03-03 18:22:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:22:39,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:39,460 INFO L225 Difference]: With dead ends: 9134 [2022-03-03 18:22:39,460 INFO L226 Difference]: Without dead ends: 9134 [2022-03-03 18:22:39,460 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:39,460 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:39,461 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:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9134 states. [2022-03-03 18:22:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9134 to 4098. [2022-03-03 18:22:39,509 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:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8090 transitions. [2022-03-03 18:22:39,513 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8090 transitions. Word has length 105 [2022-03-03 18:22:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:39,513 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 8090 transitions. [2022-03-03 18:22:39,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8090 transitions. [2022-03-03 18:22:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:39,515 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:39,515 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,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-03 18:22:39,715 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:39,715 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:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:39,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1218550201, now seen corresponding path program 28 times [2022-03-03 18:22:39,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:39,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394618730] [2022-03-03 18:22:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:39,830 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,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:39,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394618730] [2022-03-03 18:22:39,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394618730] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:39,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381744604] [2022-03-03 18:22:39,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:39,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:39,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:39,832 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:39,834 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:40,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:40,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:40,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:40,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:40,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:40,262 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:40,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:40,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381744604] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:40,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:40,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-03 18:22:40,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801904419] [2022-03-03 18:22:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:40,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:40,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:40,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:40,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:22:40,264 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:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:41,436 INFO L93 Difference]: Finished difference Result 12493 states and 24756 transitions. [2022-03-03 18:22:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-03 18:22:41,443 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:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:41,458 INFO L225 Difference]: With dead ends: 12493 [2022-03-03 18:22:41,458 INFO L226 Difference]: Without dead ends: 12493 [2022-03-03 18:22:41,459 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:41,459 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.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:41,459 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.8s Time] [2022-03-03 18:22:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2022-03-03 18:22:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 4086. [2022-03-03 18:22:41,522 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:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-03 18:22:41,526 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-03 18:22:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:41,526 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-03 18:22:41,526 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:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-03 18:22:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:41,528 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:41,528 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:41,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-03 18:22:41,738 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:41,739 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:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash 704398933, now seen corresponding path program 29 times [2022-03-03 18:22:41,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:41,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110667476] [2022-03-03 18:22:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:41,930 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,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:41,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110667476] [2022-03-03 18:22:41,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110667476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:41,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140001262] [2022-03-03 18:22:41,931 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:41,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:41,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:41,932 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:41,960 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:42,164 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:42,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:42,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:42,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:42,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,457 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:42,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:42,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140001262] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:42,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:42,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:42,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557558098] [2022-03-03 18:22:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:42,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:42,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:42,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:42,459 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:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:42,941 INFO L93 Difference]: Finished difference Result 7570 states and 14977 transitions. [2022-03-03 18:22:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:42,942 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,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:42,951 INFO L225 Difference]: With dead ends: 7570 [2022-03-03 18:22:42,951 INFO L226 Difference]: Without dead ends: 7570 [2022-03-03 18:22:42,951 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:42,951 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 612 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:42,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 1626 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:22:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2022-03-03 18:22:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 4091. [2022-03-03 18:22:43,016 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:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-03 18:22:43,020 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-03 18:22:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:43,021 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-03 18:22:43,021 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,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-03 18:22:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:43,022 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:43,022 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,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-03 18:22:43,222 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:43,223 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:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash 497429051, now seen corresponding path program 30 times [2022-03-03 18:22:43,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:43,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25736729] [2022-03-03 18:22:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:43,327 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,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:43,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25736729] [2022-03-03 18:22:43,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25736729] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:43,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926745497] [2022-03-03 18:22:43,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:43,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:43,331 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:43,332 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:43,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:43,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:43,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:43,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:43,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,804 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,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:43,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926745497] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:43,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:43,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:43,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366045098] [2022-03-03 18:22:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:43,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:43,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:43,805 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:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:44,808 INFO L93 Difference]: Finished difference Result 10529 states and 20852 transitions. [2022-03-03 18:22:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:22:44,808 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,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:44,823 INFO L225 Difference]: With dead ends: 10529 [2022-03-03 18:22:44,823 INFO L226 Difference]: Without dead ends: 10529 [2022-03-03 18:22:44,824 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:44,824 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 1307 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:44,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1307 Valid, 1861 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:22:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2022-03-03 18:22:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 4088. [2022-03-03 18:22:44,903 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:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-03 18:22:44,909 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-03 18:22:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:44,909 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-03 18:22:44,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-03 18:22:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:44,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:44,911 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:44,935 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:45,134 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:45,134 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:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1647441495, now seen corresponding path program 31 times [2022-03-03 18:22:45,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:45,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524753484] [2022-03-03 18:22:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:45,368 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,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:45,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524753484] [2022-03-03 18:22:45,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524753484] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:45,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277703087] [2022-03-03 18:22:45,369 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:45,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:45,370 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:45,370 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:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:45,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:45,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:45,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,880 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,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:45,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277703087] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:45,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:45,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:45,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891688470] [2022-03-03 18:22:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:45,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:45,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:45,881 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:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:47,122 INFO L93 Difference]: Finished difference Result 14591 states and 28933 transitions. [2022-03-03 18:22:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:22:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-03 18:22:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:47,139 INFO L225 Difference]: With dead ends: 14591 [2022-03-03 18:22:47,140 INFO L226 Difference]: Without dead ends: 14591 [2022-03-03 18:22:47,140 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:47,141 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 1595 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:47,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1595 Valid, 2224 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:22:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2022-03-03 18:22:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 4092. [2022-03-03 18:22:47,210 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:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-03 18:22:47,214 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-03 18:22:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:47,214 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-03 18:22:47,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-03 18:22:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:47,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:47,217 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:47,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-03 18:22:47,440 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:47,440 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:47,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:47,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2100594859, now seen corresponding path program 32 times [2022-03-03 18:22:47,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:47,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261181867] [2022-03-03 18:22:47,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:47,724 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,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:47,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261181867] [2022-03-03 18:22:47,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261181867] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:47,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736270713] [2022-03-03 18:22:47,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:47,728 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:47,730 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:47,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:47,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:47,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:47,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:48,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:48,307 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:48,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:48,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736270713] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:48,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:48,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:48,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689237430] [2022-03-03 18:22:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:48,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:48,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:48,309 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,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:48,987 INFO L93 Difference]: Finished difference Result 10255 states and 20309 transitions. [2022-03-03 18:22:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:22:48,988 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,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:49,000 INFO L225 Difference]: With dead ends: 10255 [2022-03-03 18:22:49,000 INFO L226 Difference]: Without dead ends: 10255 [2022-03-03 18:22:49,000 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:49,001 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1019 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:49,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1019 Valid, 1835 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:22:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-03-03 18:22:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 4094. [2022-03-03 18:22:49,060 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:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-03 18:22:49,064 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-03 18:22:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:49,065 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-03 18:22:49,065 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:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-03 18:22:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:49,067 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:49,067 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:49,084 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:49,267 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:49,268 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:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1614112233, now seen corresponding path program 33 times [2022-03-03 18:22:49,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:49,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856847593] [2022-03-03 18:22:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:49,385 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,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:49,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856847593] [2022-03-03 18:22:49,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856847593] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:49,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16216961] [2022-03-03 18:22:49,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:22:49,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:49,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:49,387 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:49,388 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:49,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:22:49,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:49,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:49,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:49,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,862 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,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:49,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16216961] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:49,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:49,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-03 18:22:49,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989254204] [2022-03-03 18:22:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:49,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:49,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:22:49,864 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:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:51,006 INFO L93 Difference]: Finished difference Result 11350 states and 22432 transitions. [2022-03-03 18:22:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:22:51,006 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,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:51,019 INFO L225 Difference]: With dead ends: 11350 [2022-03-03 18:22:51,019 INFO L226 Difference]: Without dead ends: 11350 [2022-03-03 18:22:51,019 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:51,019 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1220 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:51,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 2165 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:22:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11350 states. [2022-03-03 18:22:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11350 to 4082. [2022-03-03 18:22:51,088 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:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 8058 transitions. [2022-03-03 18:22:51,092 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 8058 transitions. Word has length 105 [2022-03-03 18:22:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:51,093 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 8058 transitions. [2022-03-03 18:22:51,093 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:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 8058 transitions. [2022-03-03 18:22:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:51,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:51,094 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:51,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-03 18:22:51,294 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:51,295 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:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2113802281, now seen corresponding path program 34 times [2022-03-03 18:22:51,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:51,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815839724] [2022-03-03 18:22:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:51,402 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:51,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:51,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815839724] [2022-03-03 18:22:51,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815839724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:51,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052966980] [2022-03-03 18:22:51,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:22:51,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:51,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:51,404 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:51,429 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:51,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:22:51,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:51,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-03 18:22:51,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:51,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,819 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,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:51,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052966980] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:51,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:51,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-03 18:22:51,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298018551] [2022-03-03 18:22:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:51,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 18:22:51,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:51,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 18:22:51,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:22:51,821 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:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:52,839 INFO L93 Difference]: Finished difference Result 15159 states and 30102 transitions. [2022-03-03 18:22:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:22:52,843 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:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:52,863 INFO L225 Difference]: With dead ends: 15159 [2022-03-03 18:22:52,863 INFO L226 Difference]: Without dead ends: 15159 [2022-03-03 18:22:52,863 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:52,864 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:52,864 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:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2022-03-03 18:22:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 4092. [2022-03-03 18:22:52,953 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:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-03 18:22:52,957 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-03 18:22:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:52,957 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-03 18:22:52,957 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:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-03 18:22:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:52,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:52,959 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,976 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:53,159 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:53,159 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:53,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1566871339, now seen corresponding path program 35 times [2022-03-03 18:22:53,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:53,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540904106] [2022-03-03 18:22:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:53,420 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:53,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:53,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540904106] [2022-03-03 18:22:53,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540904106] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:53,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156728273] [2022-03-03 18:22:53,421 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:22:53,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:53,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:53,424 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:53,425 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:53,720 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:22:53,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:53,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:53,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:53,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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,011 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,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:54,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156728273] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:54,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:54,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:54,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197075832] [2022-03-03 18:22:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:54,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:54,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:54,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:54,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:54,013 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:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:54,751 INFO L93 Difference]: Finished difference Result 12497 states and 24788 transitions. [2022-03-03 18:22:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:22:54,751 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:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:54,789 INFO L225 Difference]: With dead ends: 12497 [2022-03-03 18:22:54,789 INFO L226 Difference]: Without dead ends: 12497 [2022-03-03 18:22:54,789 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:54,789 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:54,790 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:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-03-03 18:22:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 4094. [2022-03-03 18:22:54,842 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:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-03 18:22:54,847 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-03 18:22:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:54,847 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-03 18:22:54,847 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:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-03 18:22:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:54,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:54,848 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:54,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-03 18:22:55,048 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:55,049 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:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1080388713, now seen corresponding path program 36 times [2022-03-03 18:22:55,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:55,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673043353] [2022-03-03 18:22:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:55,278 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:55,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:55,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673043353] [2022-03-03 18:22:55,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673043353] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:55,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115678455] [2022-03-03 18:22:55,278 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:22:55,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:55,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:55,280 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:22:55,280 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:55,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:22:55,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:55,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:55,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:55,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:22:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:22:55,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:55,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115678455] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:55,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:55,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:55,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248327778] [2022-03-03 18:22:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:55,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:55,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:55,784 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:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:56,966 INFO L93 Difference]: Finished difference Result 13459 states and 26664 transitions. [2022-03-03 18:22:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:22:56,966 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:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:57,009 INFO L225 Difference]: With dead ends: 13459 [2022-03-03 18:22:57,009 INFO L226 Difference]: Without dead ends: 13459 [2022-03-03 18:22:57,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:22:57,009 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1335 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:22:57,010 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.7s Time] [2022-03-03 18:22:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2022-03-03 18:22:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 4088. [2022-03-03 18:22:57,063 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:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-03 18:22:57,068 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-03 18:22:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:57,068 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-03 18:22:57,068 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:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-03 18:22:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:57,069 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:57,069 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:57,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-03 18:22:57,270 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:57,270 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:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1274129545, now seen corresponding path program 37 times [2022-03-03 18:22:57,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:57,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721769903] [2022-03-03 18:22:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-03 18:22:57,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:57,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721769903] [2022-03-03 18:22:57,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721769903] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:57,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220406733] [2022-03-03 18:22:57,447 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:22:57,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:57,448 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:57,456 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:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:57,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:57,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:57,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:57,982 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:57,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:57,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220406733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:57,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:57,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:22:57,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827808002] [2022-03-03 18:22:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:57,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:57,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:57,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:57,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:22:57,983 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:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:22:58,426 INFO L93 Difference]: Finished difference Result 8298 states and 16433 transitions. [2022-03-03 18:22:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:22:58,426 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:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:22:58,434 INFO L225 Difference]: With dead ends: 8298 [2022-03-03 18:22:58,434 INFO L226 Difference]: Without dead ends: 8298 [2022-03-03 18:22:58,435 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:58,435 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:58,435 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:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2022-03-03 18:22:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 4091. [2022-03-03 18:22:58,499 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:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-03 18:22:58,505 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-03 18:22:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:22:58,506 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-03 18:22:58,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:22:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-03 18:22:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:22:58,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:22:58,508 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:22:58,532 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:58,723 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:58,723 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:58,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:22:58,724 INFO L85 PathProgramCache]: Analyzing trace with hash -151065913, now seen corresponding path program 38 times [2022-03-03 18:22:58,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:22:58,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536403266] [2022-03-03 18:22:58,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:22:58,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:22:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:22:58,945 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:58,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:22:58,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536403266] [2022-03-03 18:22:58,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536403266] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:22:58,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203640685] [2022-03-03 18:22:58,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:22:58,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:22:58,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:22:58,949 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:58,949 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:59,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:22:59,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:22:59,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:22:59,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:22:59,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:59,456 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:59,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:22:59,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203640685] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:22:59,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:22:59,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-03 18:22:59,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190948916] [2022-03-03 18:22:59,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:22:59,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:22:59,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:22:59,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:22:59,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:22:59,457 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:23:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:00,100 INFO L93 Difference]: Finished difference Result 9996 states and 19805 transitions. [2022-03-03 18:23:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:23:00,101 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:23:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:00,113 INFO L225 Difference]: With dead ends: 9996 [2022-03-03 18:23:00,114 INFO L226 Difference]: Without dead ends: 9996 [2022-03-03 18:23:00,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 18:23:00,114 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:23:00,114 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:23:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2022-03-03 18:23:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 4093. [2022-03-03 18:23:00,168 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:23:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 8080 transitions. [2022-03-03 18:23:00,173 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 8080 transitions. Word has length 105 [2022-03-03 18:23:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:00,173 INFO L470 AbstractCegarLoop]: Abstraction has 4093 states and 8080 transitions. [2022-03-03 18:23:00,173 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:23:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 8080 transitions. [2022-03-03 18:23:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 18:23:00,174 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:00,174 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:23:00,191 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:23:00,374 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:23:00,375 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:23:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:00,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1204375993, now seen corresponding path program 39 times [2022-03-03 18:23:00,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:00,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696414508] [2022-03-03 18:23:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:00,547 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:23:00,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:00,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696414508] [2022-03-03 18:23:00,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696414508] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:23:00,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434271139] [2022-03-03 18:23:00,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:23:00,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:00,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:23:00,549 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:23:00,562 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:23:00,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:23:00,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:23:00,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-03 18:23:00,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:23:01,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:23:01,086 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:23:01,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:23:01,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434271139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:23:01,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:23:01,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:23:01,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388110742] [2022-03-03 18:23:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:23:01,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:23:01,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:23:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:23:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:23:01,088 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:23:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:02,065 INFO L93 Difference]: Finished difference Result 9499 states and 18787 transitions. [2022-03-03 18:23:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:23:02,065 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:23:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:02,075 INFO L225 Difference]: With dead ends: 9499 [2022-03-03 18:23:02,075 INFO L226 Difference]: Without dead ends: 9499 [2022-03-03 18:23:02,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 18:23:02,076 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 1102 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:23:02,076 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.6s Time] [2022-03-03 18:23:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2022-03-03 18:23:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 4073. [2022-03-03 18:23:02,127 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:23:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 8040 transitions. [2022-03-03 18:23:02,131 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 8040 transitions. Word has length 105 [2022-03-03 18:23:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:02,131 INFO L470 AbstractCegarLoop]: Abstraction has 4073 states and 8040 transitions. [2022-03-03 18:23:02,131 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:23:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 8040 transitions. [2022-03-03 18:23:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-03 18:23:02,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:02,132 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:23:02,150 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:23:02,332 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:23:02,333 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:23:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1890126863, now seen corresponding path program 1 times [2022-03-03 18:23:02,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:02,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125361801] [2022-03-03 18:23:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:02,378 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:23:02,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:02,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125361801] [2022-03-03 18:23:02,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125361801] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:23:02,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18271980] [2022-03-03 18:23:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:02,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:23:02,380 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:23:02,381 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:23:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:02,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 18:23:02,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:23:02,754 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:23:02,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:23:02,882 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:23:02,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18271980] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:23:02,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:23:02,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 18:23:02,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542364109] [2022-03-03 18:23:02,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:23:02,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:23:02,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:23:02,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:23:02,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 18:23:02,883 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:23:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:02,945 INFO L93 Difference]: Finished difference Result 7477 states and 14848 transitions. [2022-03-03 18:23:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:23:02,946 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:23:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:02,955 INFO L225 Difference]: With dead ends: 7477 [2022-03-03 18:23:02,955 INFO L226 Difference]: Without dead ends: 7477 [2022-03-03 18:23:02,955 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:23:02,956 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:23:02,956 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:23:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-03 18:23:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7321. [2022-03-03 18:23:03,021 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:23:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 14692 transitions. [2022-03-03 18:23:03,029 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 14692 transitions. Word has length 110 [2022-03-03 18:23:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:03,030 INFO L470 AbstractCegarLoop]: Abstraction has 7321 states and 14692 transitions. [2022-03-03 18:23:03,030 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:23:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 14692 transitions. [2022-03-03 18:23:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-03 18:23:03,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:03,031 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:23:03,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-03 18:23:03,232 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:23:03,232 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:23:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash -621139911, now seen corresponding path program 1 times [2022-03-03 18:23:03,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:03,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012618938] [2022-03-03 18:23:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:03,312 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:23:03,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:03,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012618938] [2022-03-03 18:23:03,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012618938] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:23:03,313 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:23:03,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:23:03,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294593002] [2022-03-03 18:23:03,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:23:03,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:23:03,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:23:03,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:23:03,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:23:03,314 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:23:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:03,504 INFO L93 Difference]: Finished difference Result 8193 states and 16446 transitions. [2022-03-03 18:23:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:23:03,505 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:23:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:03,514 INFO L225 Difference]: With dead ends: 8193 [2022-03-03 18:23:03,514 INFO L226 Difference]: Without dead ends: 7610 [2022-03-03 18:23:03,514 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:23:03,515 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:23:03,515 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:23:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-03 18:23:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6942. [2022-03-03 18:23:03,581 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:23:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 13942 transitions. [2022-03-03 18:23:03,589 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 13942 transitions. Word has length 114 [2022-03-03 18:23:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:03,590 INFO L470 AbstractCegarLoop]: Abstraction has 6942 states and 13942 transitions. [2022-03-03 18:23:03,590 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:23:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 13942 transitions. [2022-03-03 18:23:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:23:03,593 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:03,593 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:23:03,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-03 18:23:03,593 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:23:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash 901308923, now seen corresponding path program 1 times [2022-03-03 18:23:03,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:03,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146146734] [2022-03-03 18:23:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:23:03,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:03,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146146734] [2022-03-03 18:23:03,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146146734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:23:03,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772477903] [2022-03-03 18:23:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:03,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:23:03,849 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:23:03,849 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:23:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:04,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:23:04,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:23:04,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:23:04,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:23:04,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:23:04,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:04,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:23:05,067 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:23:05,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-03 18:23:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:23:05,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:23:05,972 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:08,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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|))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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))))))) is different from false [2022-03-03 18:23:11,088 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 (> 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 (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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| 2))) (< 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 (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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| 1))) (>= |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 (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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| 3))) (> 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))))) is different from false [2022-03-03 18:23:13,400 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| (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_~#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|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (> 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|) (= |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_~#cache~0.base| (store (select .cse1 |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| 2))) (>= |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|) (= |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_~#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))) (>= |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 (= |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_~#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| 1))) (> 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))))) is different from false [2022-03-03 18:23:37,036 WARN L228 SmtUtils]: Spent 13.15s 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:23:39,473 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:23:39,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:39,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:23:42,276 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:23:42,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772477903] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:23:42,276 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:23:42,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:23:42,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771814930] [2022-03-03 18:23:42,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:23:42,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:23:42,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:23:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:23:42,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1014, Unknown=10, NotChecked=350, Total=1560 [2022-03-03 18:23:42,278 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:23:46,065 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 (<= 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)) (= |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|) (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| (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_~#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|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (> 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|) (= |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_~#cache~0.base| (store (select .cse3 |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| 2))) (>= |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|) (= |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_~#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|) .cse5))) (>= |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 (= |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 (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 .cse6 |c_~#cache~0.base| (store (select .cse6 |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| 1))) (> 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)))) (= |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|) (= |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:23:48,099 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (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 (> 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 (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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| 2))) (< 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 (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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)))) (= |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))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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| 1))) (>= |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 (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |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| 3))) (> 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)))) (= |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)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-03 18:23:50,225 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 (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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|))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.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))))))) (= |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_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |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 (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|) (= |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:23:52,348 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:23:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:23:55,052 INFO L93 Difference]: Finished difference Result 13835 states and 27713 transitions. [2022-03-03 18:23:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:23:55,052 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:23:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:23:55,071 INFO L225 Difference]: With dead ends: 13835 [2022-03-03 18:23:55,071 INFO L226 Difference]: Without dead ends: 13835 [2022-03-03 18:23:55,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=365, Invalid=1913, Unknown=14, NotChecked=900, Total=3192 [2022-03-03 18:23:55,071 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1643 mSDsluCounter, 4354 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 4792 SdHoareTripleChecker+Invalid, 5837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3683 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:23:55,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 4792 Invalid, 5837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2109 Invalid, 0 Unknown, 3683 Unchecked, 3.7s Time] [2022-03-03 18:23:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-03-03 18:23:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 6988. [2022-03-03 18:23:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6988 states, 6975 states have (on average 2.0120430107526883) internal successors, (14034), 6987 states have internal predecessors, (14034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:23:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 14034 transitions. [2022-03-03 18:23:55,180 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 14034 transitions. Word has length 134 [2022-03-03 18:23:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:23:55,180 INFO L470 AbstractCegarLoop]: Abstraction has 6988 states and 14034 transitions. [2022-03-03 18:23:55,180 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:23:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 14034 transitions. [2022-03-03 18:23:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:23:55,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:23:55,183 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:23:55,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-03-03 18:23:55,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:55,385 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:23:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:23:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2095982239, now seen corresponding path program 2 times [2022-03-03 18:23:55,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:23:55,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829798308] [2022-03-03 18:23:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:23:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:23:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:23:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-03 18:23:56,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:23:56,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829798308] [2022-03-03 18:23:56,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829798308] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:23:56,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785569834] [2022-03-03 18:23:56,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:23:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:23:56,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:23:56,052 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:23:56,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-03 18:23:56,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:23:56,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:23:56,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:23:56,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:23:56,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:23:57,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:23:57,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:23:57,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:23:57,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:57,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:23:58,313 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:23:58,313 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:23:58,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:23:58,524 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:23:58,627 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:23:58,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:00,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:00,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:01,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:01,345 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:01,795 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:01,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785569834] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:01,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:24:01,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:24:01,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552870412] [2022-03-03 18:24:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:24:01,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:24:01,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:24:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:24:01,796 INFO L87 Difference]: Start difference. First operand 6988 states and 14034 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:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:03,965 INFO L93 Difference]: Finished difference Result 9186 states and 18419 transitions. [2022-03-03 18:24:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:24:03,966 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:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:03,978 INFO L225 Difference]: With dead ends: 9186 [2022-03-03 18:24:03,978 INFO L226 Difference]: Without dead ends: 9186 [2022-03-03 18:24:03,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=269, Invalid=1987, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 18:24:03,979 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 277 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1000 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:03,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 2211 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 1000 Unchecked, 0.4s Time] [2022-03-03 18:24:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9186 states. [2022-03-03 18:24:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9186 to 7010. [2022-03-03 18:24:04,048 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:24:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 14078 transitions. [2022-03-03 18:24:04,057 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 14078 transitions. Word has length 134 [2022-03-03 18:24:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:04,057 INFO L470 AbstractCegarLoop]: Abstraction has 7010 states and 14078 transitions. [2022-03-03 18:24:04,058 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:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 14078 transitions. [2022-03-03 18:24:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:04,060 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:04,060 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:04,081 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:04,268 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:04,269 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:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 658342497, now seen corresponding path program 3 times [2022-03-03 18:24:04,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:04,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412309947] [2022-03-03 18:24:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:04,935 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:04,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:04,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412309947] [2022-03-03 18:24:04,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412309947] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:04,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734268830] [2022-03-03 18:24:04,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:24:04,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:04,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:04,941 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:04,942 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:05,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:24:05,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:05,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:24:05,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:05,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:06,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:06,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,161 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:06,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,276 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:06,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:06,649 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:07,193 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:24:07,193 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:07,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:07,451 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:07,561 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:07,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:09,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:09,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:10,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:10,046 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:10,534 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:10,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734268830] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:10,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:24:10,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:24:10,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197225985] [2022-03-03 18:24:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:24:10,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:24:10,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:10,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:24:10,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:24:10,536 INFO L87 Difference]: Start difference. First operand 7010 states and 14078 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:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:12,111 INFO L93 Difference]: Finished difference Result 9115 states and 18287 transitions. [2022-03-03 18:24:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:24:12,112 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:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:12,126 INFO L225 Difference]: With dead ends: 9115 [2022-03-03 18:24:12,126 INFO L226 Difference]: Without dead ends: 9115 [2022-03-03 18:24:12,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:24:12,127 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 269 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:12,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 1789 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 460 Unchecked, 0.4s Time] [2022-03-03 18:24:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9115 states. [2022-03-03 18:24:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9115 to 7014. [2022-03-03 18:24:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 7001 states have (on average 2.0119982859591485) internal successors, (14086), 7013 states have internal predecessors, (14086), 0 states have call successors, (0), 0 states have call 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:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 14086 transitions. [2022-03-03 18:24:12,299 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 14086 transitions. Word has length 134 [2022-03-03 18:24:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:12,299 INFO L470 AbstractCegarLoop]: Abstraction has 7014 states and 14086 transitions. [2022-03-03 18:24:12,299 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:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 14086 transitions. [2022-03-03 18:24:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:12,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:12,303 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:12,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-03 18:24:12,519 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:24:12,519 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:24:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -339667099, now seen corresponding path program 4 times [2022-03-03 18:24:12,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:12,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015419424] [2022-03-03 18:24:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:13,171 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:13,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:13,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015419424] [2022-03-03 18:24:13,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015419424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:13,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477895341] [2022-03-03 18:24:13,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:24:13,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:13,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:13,173 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:24:13,174 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:24:13,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:24:13,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:13,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-03 18:24:13,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:13,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:24:14,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:14,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,225 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:14,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,328 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:14,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,715 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:14,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:14,988 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:24:15,220 INFO L353 Elim1Store]: treesize reduction 212, result has 14.2 percent of original size [2022-03-03 18:24:15,221 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:24:15,237 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:24:15,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:24,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:24,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:24,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:24,299 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:24:24,312 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-03 18:24:24,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:24,319 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-03 18:24:24,843 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:24:24,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477895341] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:24:24,843 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:24:24,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 38 [2022-03-03 18:24:24,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404743644] [2022-03-03 18:24:24,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:24:24,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-03 18:24:24,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-03 18:24:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1290, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:24:24,845 INFO L87 Difference]: Start difference. First operand 7014 states and 14086 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:24:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:38,795 INFO L93 Difference]: Finished difference Result 12447 states and 24701 transitions. [2022-03-03 18:24:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-03 18:24:38,795 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:24:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:38,837 INFO L225 Difference]: With dead ends: 12447 [2022-03-03 18:24:38,837 INFO L226 Difference]: Without dead ends: 12447 [2022-03-03 18:24:38,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=1102, Invalid=6378, Unknown=2, NotChecked=0, Total=7482 [2022-03-03 18:24:38,838 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 1934 mSDsluCounter, 8052 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 8701 SdHoareTripleChecker+Invalid, 5623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2737 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:38,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1934 Valid, 8701 Invalid, 5623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2726 Invalid, 0 Unknown, 2737 Unchecked, 4.9s Time] [2022-03-03 18:24:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2022-03-03 18:24:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 6994. [2022-03-03 18:24:38,909 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:24:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 14046 transitions. [2022-03-03 18:24:38,917 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 14046 transitions. Word has length 134 [2022-03-03 18:24:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:38,917 INFO L470 AbstractCegarLoop]: Abstraction has 6994 states and 14046 transitions. [2022-03-03 18:24:38,917 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:24:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 14046 transitions. [2022-03-03 18:24:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:38,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:38,920 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:38,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-03 18:24:39,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-03 18:24:39,121 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:24:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash -423512185, now seen corresponding path program 5 times [2022-03-03 18:24:39,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:39,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585881756] [2022-03-03 18:24:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:39,804 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:39,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:39,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585881756] [2022-03-03 18:24:39,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585881756] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:39,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829334754] [2022-03-03 18:24:39,805 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:24:39,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:39,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:39,807 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:24:39,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-03 18:24:40,170 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:24:40,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:40,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:24:40,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:41,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:24:41,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:41,902 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:42,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,028 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:42,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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:42,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:42,973 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:24:43,087 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:43,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:45,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:45,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:46,660 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:24:46,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829334754] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:24:46,661 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:24:46,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:24:46,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703291008] [2022-03-03 18:24:46,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:24:46,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:24:46,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:24:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:24:46,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:24:46,662 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:24:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:24:53,603 INFO L93 Difference]: Finished difference Result 7915 states and 15809 transitions. [2022-03-03 18:24:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:24:53,603 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:24:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:24:53,612 INFO L225 Difference]: With dead ends: 7915 [2022-03-03 18:24:53,612 INFO L226 Difference]: Without dead ends: 7915 [2022-03-03 18:24:53,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=711, Invalid=2949, Unknown=0, NotChecked=0, Total=3660 [2022-03-03 18:24:53,612 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 1624 mSDsluCounter, 6100 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 6566 SdHoareTripleChecker+Invalid, 4037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1206 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:24:53,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1624 Valid, 6566 Invalid, 4037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2719 Invalid, 0 Unknown, 1206 Unchecked, 4.7s Time] [2022-03-03 18:24:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7915 states. [2022-03-03 18:24:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7915 to 7040. [2022-03-03 18:24:53,674 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:24:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7040 states to 7040 states and 14140 transitions. [2022-03-03 18:24:53,682 INFO L78 Accepts]: Start accepts. Automaton has 7040 states and 14140 transitions. Word has length 134 [2022-03-03 18:24:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:24:53,682 INFO L470 AbstractCegarLoop]: Abstraction has 7040 states and 14140 transitions. [2022-03-03 18:24:53,682 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:24:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7040 states and 14140 transitions. [2022-03-03 18:24:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:24:53,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:24:53,685 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:53,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-03 18:24:53,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-03 18:24:53,886 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:24:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:24:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash -893918699, now seen corresponding path program 6 times [2022-03-03 18:24:53,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:24:53,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055182141] [2022-03-03 18:24:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:24:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:24:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:24:54,562 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:54,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:24:54,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055182141] [2022-03-03 18:24:54,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055182141] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:24:54,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788756768] [2022-03-03 18:24:54,562 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:24:54,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:24:54,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:24:54,564 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:24:54,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-03 18:24:54,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:24:54,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:24:54,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:24:54,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:24:55,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:55,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:55,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:55,835 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:56,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,162 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:56,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:56,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:24:56,826 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:24:56,827 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:57,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:57,086 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:57,175 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:57,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:24:59,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:24:59,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:24:59,730 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:00,186 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:00,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788756768] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:00,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:25:00,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:25:00,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300363624] [2022-03-03 18:25:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:00,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:25:00,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:25:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:25:00,188 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:25:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:01,731 INFO L93 Difference]: Finished difference Result 9121 states and 18320 transitions. [2022-03-03 18:25:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:25:01,732 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:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:01,742 INFO L225 Difference]: With dead ends: 9121 [2022-03-03 18:25:01,742 INFO L226 Difference]: Without dead ends: 9121 [2022-03-03 18:25:01,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 18:25:01,742 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 276 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:01,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 1850 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 512 Unchecked, 0.5s Time] [2022-03-03 18:25:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2022-03-03 18:25:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 7068. [2022-03-03 18:25:01,815 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:25:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7068 states to 7068 states and 14196 transitions. [2022-03-03 18:25:01,825 INFO L78 Accepts]: Start accepts. Automaton has 7068 states and 14196 transitions. Word has length 134 [2022-03-03 18:25:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:01,825 INFO L470 AbstractCegarLoop]: Abstraction has 7068 states and 14196 transitions. [2022-03-03 18:25:01,825 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:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7068 states and 14196 transitions. [2022-03-03 18:25:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:25:01,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:01,828 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:01,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-03-03 18:25:02,028 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:25:02,029 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:25:02,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1859931871, now seen corresponding path program 7 times [2022-03-03 18:25:02,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:02,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77006465] [2022-03-03 18:25:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:02,732 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:02,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:02,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77006465] [2022-03-03 18:25:02,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77006465] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:02,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592644995] [2022-03-03 18:25:02,732 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:25:02,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:02,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:02,733 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:25:02,734 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:25:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:03,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:25:03,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:04,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:04,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,243 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:04,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,540 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:04,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:04,813 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:05,269 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:25:05,269 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:25:05,357 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:05,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:12,070 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:25:51,209 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:25:58,440 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:25:58,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592644995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:58,441 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:58,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:25:58,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213239891] [2022-03-03 18:25:58,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:58,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:25:58,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:25:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1221, Unknown=22, NotChecked=146, Total=1560 [2022-03-03 18:25:58,442 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:26:02,975 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:26:06,810 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))) (<= 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_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 (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|) (<= (+ 28 |c_~#cache~0.offset|) |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:26:08,928 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))) (<= 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) (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_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 (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|) (<= (+ 28 |c_~#cache~0.offset|) |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:26:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:15,039 INFO L93 Difference]: Finished difference Result 15364 states and 30795 transitions. [2022-03-03 18:26:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-03 18:26:15,039 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:26:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:15,060 INFO L225 Difference]: With dead ends: 15364 [2022-03-03 18:26:15,060 INFO L226 Difference]: Without dead ends: 15364 [2022-03-03 18:26:15,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=479, Invalid=3176, Unknown=25, NotChecked=610, Total=4290 [2022-03-03 18:26:15,061 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 1462 mSDsluCounter, 5942 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 6413 SdHoareTripleChecker+Invalid, 4936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2417 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:15,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 6413 Invalid, 4936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2458 Invalid, 0 Unknown, 2417 Unchecked, 7.6s Time] [2022-03-03 18:26:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15364 states. [2022-03-03 18:26:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15364 to 7090. [2022-03-03 18:26:15,173 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:26:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7090 states to 7090 states and 14240 transitions. [2022-03-03 18:26:15,183 INFO L78 Accepts]: Start accepts. Automaton has 7090 states and 14240 transitions. Word has length 134 [2022-03-03 18:26:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:15,183 INFO L470 AbstractCegarLoop]: Abstraction has 7090 states and 14240 transitions. [2022-03-03 18:26:15,184 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:26:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7090 states and 14240 transitions. [2022-03-03 18:26:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:26:15,187 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:15,187 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:15,205 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:26:15,391 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:26:15,391 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:26:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -798158221, now seen corresponding path program 8 times [2022-03-03 18:26:15,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:15,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174742619] [2022-03-03 18:26:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:16,577 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:16,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:16,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174742619] [2022-03-03 18:26:16,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174742619] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:16,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424586980] [2022-03-03 18:26:16,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:26:16,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:16,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:16,579 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:26:16,580 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:26:16,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:26:16,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:26:16,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:26:16,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:17,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:26:18,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:18,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:18,519 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:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,041 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:19,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:19,542 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:20,067 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:26:20,068 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:20,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:20,435 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:20,634 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:26:20,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:23,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:23,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:24,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:24,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:26:25,205 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:25,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424586980] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:25,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:26:25,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:26:25,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407573926] [2022-03-03 18:26:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:25,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:26:25,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:26:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:26:25,206 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:26:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:27,853 INFO L93 Difference]: Finished difference Result 9142 states and 18361 transitions. [2022-03-03 18:26:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:27,853 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:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:27,862 INFO L225 Difference]: With dead ends: 9142 [2022-03-03 18:26:27,862 INFO L226 Difference]: Without dead ends: 9142 [2022-03-03 18:26:27,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=218, Invalid=1674, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:26:27,863 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 264 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 869 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:27,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 2115 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 869 Unchecked, 0.9s Time] [2022-03-03 18:26:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9142 states. [2022-03-03 18:26:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9142 to 7100. [2022-03-03 18:26:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7100 states, 7087 states have (on average 2.0121348948779456) internal successors, (14260), 7099 states have internal predecessors, (14260), 0 states have call successors, (0), 0 states have call 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:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7100 states to 7100 states and 14260 transitions. [2022-03-03 18:26:27,934 INFO L78 Accepts]: Start accepts. Automaton has 7100 states and 14260 transitions. Word has length 134 [2022-03-03 18:26:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:27,934 INFO L470 AbstractCegarLoop]: Abstraction has 7100 states and 14260 transitions. [2022-03-03 18:26:27,934 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:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7100 states and 14260 transitions. [2022-03-03 18:26:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:26:27,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:27,937 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:27,955 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:26:28,138 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:26:28,138 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:26:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1776086785, now seen corresponding path program 9 times [2022-03-03 18:26:28,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:28,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851035129] [2022-03-03 18:26:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:29,464 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:29,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:29,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851035129] [2022-03-03 18:26:29,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851035129] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:29,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149413030] [2022-03-03 18:26:29,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:26:29,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:29,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:29,466 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:26:29,467 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:26:29,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:26:29,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:26:29,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:26:29,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:30,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:31,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:31,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:31,442 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:31,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:31,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:31,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:31,946 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:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:32,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:32,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:32,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:32,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:32,928 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:26:32,928 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:33,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:33,333 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:33,502 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:26:33,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:36,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:36,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:37,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:37,483 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:38,172 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:38,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149413030] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:38,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:26:38,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:26:38,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322010791] [2022-03-03 18:26:38,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:38,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:26:38,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:38,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:26:38,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:26:38,173 INFO L87 Difference]: Start difference. First operand 7100 states and 14260 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:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:40,881 INFO L93 Difference]: Finished difference Result 9160 states and 18398 transitions. [2022-03-03 18:26:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:40,881 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:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:40,892 INFO L225 Difference]: With dead ends: 9160 [2022-03-03 18:26:40,892 INFO L226 Difference]: Without dead ends: 9160 [2022-03-03 18:26:40,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:26:40,893 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 266 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:40,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 1845 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 698 Unchecked, 0.8s Time] [2022-03-03 18:26:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9160 states. [2022-03-03 18:26:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9160 to 7102. [2022-03-03 18:26:40,966 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:26:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 14264 transitions. [2022-03-03 18:26:40,975 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 14264 transitions. Word has length 134 [2022-03-03 18:26:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:40,975 INFO L470 AbstractCegarLoop]: Abstraction has 7102 states and 14264 transitions. [2022-03-03 18:26:40,975 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:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 14264 transitions. [2022-03-03 18:26:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:26:40,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:40,978 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:40,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-03 18:26:41,178 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:26:41,178 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:26:41,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1853945391, now seen corresponding path program 10 times [2022-03-03 18:26:41,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:41,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083372692] [2022-03-03 18:26:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:42,414 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:42,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:42,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083372692] [2022-03-03 18:26:42,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083372692] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:42,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936980073] [2022-03-03 18:26:42,414 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:26:42,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:42,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:42,416 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:26:42,416 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:26:42,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:26:42,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:26:42,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:26:42,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:44,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:44,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:44,879 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:45,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:45,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:45,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:45,355 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:46,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,054 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:46,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:26:46,415 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:26:46,415 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:26:46,583 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:46,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:50,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:50,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:26:51,942 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:51,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936980073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:26:51,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:26:51,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:26:51,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218615770] [2022-03-03 18:26:51,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:26:51,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:26:51,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:51,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:26:51,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:26:51,944 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:27:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:01,693 INFO L93 Difference]: Finished difference Result 8334 states and 16652 transitions. [2022-03-03 18:27:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:27:01,694 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:27:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:01,704 INFO L225 Difference]: With dead ends: 8334 [2022-03-03 18:27:01,704 INFO L226 Difference]: Without dead ends: 8334 [2022-03-03 18:27:01,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 244 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=700, Invalid=2960, Unknown=0, NotChecked=0, Total=3660 [2022-03-03 18:27:01,705 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 1252 mSDsluCounter, 5377 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 5838 SdHoareTripleChecker+Invalid, 3503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1369 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:01,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1252 Valid, 5838 Invalid, 3503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1990 Invalid, 0 Unknown, 1369 Unchecked, 6.2s Time] [2022-03-03 18:27:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2022-03-03 18:27:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 7162. [2022-03-03 18:27:01,803 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:27:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7162 states to 7162 states and 14386 transitions. [2022-03-03 18:27:01,812 INFO L78 Accepts]: Start accepts. Automaton has 7162 states and 14386 transitions. Word has length 134 [2022-03-03 18:27:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:01,812 INFO L470 AbstractCegarLoop]: Abstraction has 7162 states and 14386 transitions. [2022-03-03 18:27:01,812 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:27:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7162 states and 14386 transitions. [2022-03-03 18:27:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:27:01,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:01,814 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:01,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-03-03 18:27:02,015 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:27:02,015 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:27:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash 802601147, now seen corresponding path program 11 times [2022-03-03 18:27:02,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:02,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166046951] [2022-03-03 18:27:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:03,160 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:03,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:03,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166046951] [2022-03-03 18:27:03,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166046951] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:03,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026934157] [2022-03-03 18:27:03,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:27:03,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:03,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:03,162 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:27:03,163 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:27:03,567 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:27:03,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:27:03,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:27:03,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:06,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:06,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:06,443 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:07,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,153 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:07,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:07,371 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:08,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:08,112 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:27:08,285 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:08,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:27:11,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:11,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:13,402 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:13,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026934157] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:27:13,402 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:27:13,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:27:13,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933427781] [2022-03-03 18:27:13,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:27:13,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:27:13,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:13,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:27:13,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1454, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:27:13,404 INFO L87 Difference]: Start difference. First operand 7162 states and 14386 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:27:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:21,030 INFO L93 Difference]: Finished difference Result 7849 states and 15679 transitions. [2022-03-03 18:27:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:27:21,030 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:27:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:21,040 INFO L225 Difference]: With dead ends: 7849 [2022-03-03 18:27:21,040 INFO L226 Difference]: Without dead ends: 7849 [2022-03-03 18:27:21,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=515, Invalid=2565, Unknown=0, NotChecked=0, Total=3080 [2022-03-03 18:27:21,041 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 1294 mSDsluCounter, 5160 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 5603 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1099 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:21,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 5603 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1664 Invalid, 0 Unknown, 1099 Unchecked, 5.1s Time] [2022-03-03 18:27:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7849 states. [2022-03-03 18:27:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7849 to 7170. [2022-03-03 18:27:21,127 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:27:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 14402 transitions. [2022-03-03 18:27:21,137 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 14402 transitions. Word has length 134 [2022-03-03 18:27:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:21,138 INFO L470 AbstractCegarLoop]: Abstraction has 7170 states and 14402 transitions. [2022-03-03 18:27:21,138 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:27:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 14402 transitions. [2022-03-03 18:27:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:27:21,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:21,140 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:21,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-03 18:27:21,341 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:27:21,341 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:27:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 718756061, now seen corresponding path program 12 times [2022-03-03 18:27:21,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:21,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227305766] [2022-03-03 18:27:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:22,558 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:22,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:22,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227305766] [2022-03-03 18:27:22,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227305766] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:22,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24245799] [2022-03-03 18:27:22,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:27:22,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:22,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:22,559 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:27:22,560 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:27:22,865 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:27:22,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:27:22,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:27:22,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:23,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:24,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:27:24,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:24,535 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:25,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,234 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:25,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:25,709 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:25,988 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:27:25,988 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:26,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:26,361 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:26,527 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:27:26,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:27:29,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:29,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:27:30,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:30,553 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:31,264 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:31,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24245799] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:31,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:27:31,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:27:31,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014654301] [2022-03-03 18:27:31,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:31,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:27:31,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:27:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:27:31,266 INFO L87 Difference]: Start difference. First operand 7170 states and 14402 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:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:33,451 INFO L93 Difference]: Finished difference Result 8843 states and 17766 transitions. [2022-03-03 18:27:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:27:33,452 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:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:33,462 INFO L225 Difference]: With dead ends: 8843 [2022-03-03 18:27:33,462 INFO L226 Difference]: Without dead ends: 8843 [2022-03-03 18:27:33,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:27:33,463 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 265 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:33,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 1513 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 315 Unchecked, 0.4s Time] [2022-03-03 18:27:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-03-03 18:27:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 7172. [2022-03-03 18:27:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 7159 states have (on average 2.012292219583741) internal successors, (14406), 7171 states have internal predecessors, (14406), 0 states have call successors, (0), 0 states have call 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:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 14406 transitions. [2022-03-03 18:27:33,543 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 14406 transitions. Word has length 134 [2022-03-03 18:27:33,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:33,543 INFO L470 AbstractCegarLoop]: Abstraction has 7172 states and 14406 transitions. [2022-03-03 18:27:33,543 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:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 14406 transitions. [2022-03-03 18:27:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:27:33,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:33,546 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:33,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-03-03 18:27:33,746 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:27:33,747 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:27:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1383691181, now seen corresponding path program 13 times [2022-03-03 18:27:33,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:33,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514464107] [2022-03-03 18:27:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:34,919 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:34,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:34,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514464107] [2022-03-03 18:27:34,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514464107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:34,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108449413] [2022-03-03 18:27:34,920 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:27:34,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:34,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:34,921 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:27:34,922 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:27:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:35,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:27:35,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:37,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:37,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:37,203 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:37,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:37,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:37,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:37,866 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:38,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:38,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:38,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:38,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:38,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:38,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:27:38,372 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:38,827 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:27:38,828 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:27:39,003 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:39,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:29:05,034 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:28,571 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:29:28,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108449413] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:29:28,571 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:29:28,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:29:28,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118419141] [2022-03-03 18:29:28,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:29:28,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:29:28,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:29:28,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:29:28,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1272, Unknown=48, NotChecked=74, Total=1560 [2022-03-03 18:29:28,572 INFO L87 Difference]: Start difference. First operand 7172 states and 14406 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:32,881 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:35,148 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:37,224 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:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:29:44,270 INFO L93 Difference]: Finished difference Result 14455 states and 28988 transitions. [2022-03-03 18:29:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:29:44,271 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:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:29:44,289 INFO L225 Difference]: With dead ends: 14455 [2022-03-03 18:29:44,289 INFO L226 Difference]: Without dead ends: 14455 [2022-03-03 18:29:44,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 118.9s TimeCoverageRelationStatistics Valid=353, Invalid=2367, Unknown=52, NotChecked=420, Total=3192 [2022-03-03 18:29:44,290 INFO L933 BasicCegarLoop]: 478 mSDtfsCounter, 1611 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 3715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1794 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:29:44,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 5179 Invalid, 3715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1867 Invalid, 0 Unknown, 1794 Unchecked, 5.8s Time] [2022-03-03 18:29:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14455 states. [2022-03-03 18:29:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14455 to 7178. [2022-03-03 18:29:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7178 states, 7165 states have (on average 2.012281926029309) internal successors, (14418), 7177 states have internal predecessors, (14418), 0 states have call successors, (0), 0 states have call 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:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7178 states to 7178 states and 14418 transitions. [2022-03-03 18:29:44,399 INFO L78 Accepts]: Start accepts. Automaton has 7178 states and 14418 transitions. Word has length 134 [2022-03-03 18:29:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:29:44,399 INFO L470 AbstractCegarLoop]: Abstraction has 7178 states and 14418 transitions. [2022-03-03 18:29:44,400 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:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 7178 states and 14418 transitions. [2022-03-03 18:29:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:29:44,402 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:29:44,402 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:44,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-03-03 18:29:44,603 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:44,603 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:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:29:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1406809121, now seen corresponding path program 14 times [2022-03-03 18:29:44,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:29:44,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101673720] [2022-03-03 18:29:44,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:29:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:29:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:29:45,741 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:45,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:29:45,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101673720] [2022-03-03 18:29:45,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101673720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:45,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126982242] [2022-03-03 18:29:45,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:29:45,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:29:45,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:29:45,743 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:45,744 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:46,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:29:46,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:29:46,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:29:46,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:29:47,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:29:47,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:29:47,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:47,747 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:48,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:48,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:48,449 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:48,960 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:29:48,961 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:49,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:49,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:49,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:49,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:49,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:49,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:49,302 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 43 treesize of output 48 [2022-03-03 18:29:49,554 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-03 18:29:49,555 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:29:49,731 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:49,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:29:51,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:51,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:51,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:51,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:29:52,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:52,830 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:53,454 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:53,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126982242] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:53,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:29:53,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 37 [2022-03-03 18:29:53,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734797902] [2022-03-03 18:29:53,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:29:53,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:29:53,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:29:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:29:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:29:53,456 INFO L87 Difference]: Start difference. First operand 7178 states and 14418 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:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:29:55,939 INFO L93 Difference]: Finished difference Result 9157 states and 18368 transitions. [2022-03-03 18:29:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:29:55,940 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:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:29:55,950 INFO L225 Difference]: With dead ends: 9157 [2022-03-03 18:29:55,951 INFO L226 Difference]: Without dead ends: 9157 [2022-03-03 18:29:55,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:29:55,951 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 277 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1045 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:29:55,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 2009 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 1045 Unchecked, 0.8s Time] [2022-03-03 18:29:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2022-03-03 18:29:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 7180. [2022-03-03 18:29:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7180 states, 7167 states have (on average 2.01227849867448) internal successors, (14422), 7179 states have internal predecessors, (14422), 0 states have call successors, (0), 0 states have call 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:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7180 states to 7180 states and 14422 transitions. [2022-03-03 18:29:56,030 INFO L78 Accepts]: Start accepts. Automaton has 7180 states and 14422 transitions. Word has length 134 [2022-03-03 18:29:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:29:56,030 INFO L470 AbstractCegarLoop]: Abstraction has 7180 states and 14422 transitions. [2022-03-03 18:29:56,030 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:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7180 states and 14422 transitions. [2022-03-03 18:29:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:29:56,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:29:56,033 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:56,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-03-03 18:29:56,233 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:56,233 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:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:29:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1570150843, now seen corresponding path program 15 times [2022-03-03 18:29:56,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:29:56,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932179770] [2022-03-03 18:29:56,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:29:56,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:29:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:29:57,450 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:57,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:29:57,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932179770] [2022-03-03 18:29:57,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932179770] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:57,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714145557] [2022-03-03 18:29:57,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:29:57,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:29:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:29:57,451 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:57,452 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:57,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:29:57,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:29:57,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:29:57,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:29:58,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:59,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:29:59,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:29:59,375 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:00,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,346 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:00,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:00,567 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:00,859 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:30:00,860 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:01,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:01,231 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:01,396 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:01,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:30:04,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:04,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:05,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:05,519 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:06,251 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:06,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714145557] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:30:06,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:30:06,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:30:06,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943603192] [2022-03-03 18:30:06,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:30:06,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:30:06,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:30:06,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:30:06,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:30:06,253 INFO L87 Difference]: Start difference. First operand 7180 states and 14422 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:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:30:09,119 INFO L93 Difference]: Finished difference Result 9186 states and 18456 transitions. [2022-03-03 18:30:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:30:09,120 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:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:30:09,130 INFO L225 Difference]: With dead ends: 9186 [2022-03-03 18:30:09,131 INFO L226 Difference]: Without dead ends: 9186 [2022-03-03 18:30:09,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=208, Invalid=1684, Unknown=0, NotChecked=0, Total=1892 [2022-03-03 18:30:09,131 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 263 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 909 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:30:09,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 2040 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 909 Unchecked, 0.9s Time] [2022-03-03 18:30:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9186 states. [2022-03-03 18:30:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9186 to 7184. [2022-03-03 18:30:09,218 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:30:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7184 states to 7184 states and 14430 transitions. [2022-03-03 18:30:09,227 INFO L78 Accepts]: Start accepts. Automaton has 7184 states and 14430 transitions. Word has length 134 [2022-03-03 18:30:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:30:09,227 INFO L470 AbstractCegarLoop]: Abstraction has 7184 states and 14430 transitions. [2022-03-03 18:30:09,227 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:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7184 states and 14430 transitions. [2022-03-03 18:30:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:30:09,229 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:30:09,229 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:09,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-03-03 18:30:09,430 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:09,430 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:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:30:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2059881333, now seen corresponding path program 16 times [2022-03-03 18:30:09,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:30:09,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525665647] [2022-03-03 18:30:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:30:09,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:30:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:30:10,723 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:10,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:30:10,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525665647] [2022-03-03 18:30:10,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525665647] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:30:10,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366142709] [2022-03-03 18:30:10,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:30:10,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:30:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:30:10,725 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:10,726 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:11,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:30:11,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:30:11,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-03 18:30:11,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:30:11,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:11,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:11,934 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:12,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,470 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:12,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,701 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:12,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:12,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:13,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:30:13,002 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:30:13,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:30:13,030 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:13,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:30:16,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7045 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |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_7045 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_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_7045 Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |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|))))) is different from false [2022-03-03 18:30:18,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|) (and (forall ((v_ArrVal_7045 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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7045 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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |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:30:22,170 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (= |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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (= (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_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |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|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|) (= (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_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) is different from false [2022-03-03 18:30:45,694 WARN L228 SmtUtils]: Spent 11.14s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 18:30:45,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:45,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:30:48,636 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:48,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366142709] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:30:48,636 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:30:48,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-03-03 18:30:48,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958594023] [2022-03-03 18:30:48,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:30:48,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-03 18:30:48,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:30:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-03 18:30:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=598, Unknown=6, NotChecked=156, Total=870 [2022-03-03 18:30:48,637 INFO L87 Difference]: Start difference. First operand 7184 states and 14430 transitions. Second operand has 30 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call 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:52,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (= |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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (= (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_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |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|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |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_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (v_ArrVal_7045 Int)) (or (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (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|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| |c_~#cache~0.offset| 1) v_ArrVal_7045))) |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_#t~nondet33#1| (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= .cse7 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|) (<= .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-03-03 18:30:54,450 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|) (and (forall ((v_ArrVal_7045 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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7045 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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |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:30:56,667 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28) |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))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7045 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |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_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 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_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |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_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-03-03 18:31:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:31:00,984 INFO L93 Difference]: Finished difference Result 13389 states and 26881 transitions. [2022-03-03 18:31:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:31:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:31:01,001 INFO L225 Difference]: With dead ends: 13389 [2022-03-03 18:31:01,001 INFO L226 Difference]: Without dead ends: 13389 [2022-03-03 18:31:01,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=207, Invalid=1214, Unknown=9, NotChecked=462, Total=1892 [2022-03-03 18:31:01,002 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 1208 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 3934 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2063 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:31:01,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1208 Valid, 3934 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1676 Invalid, 0 Unknown, 2063 Unchecked, 5.3s Time] [2022-03-03 18:31:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2022-03-03 18:31:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 7276. [2022-03-03 18:31:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7276 states, 7263 states have (on average 2.0129423103400796) internal successors, (14620), 7275 states have internal predecessors, (14620), 0 states have call successors, (0), 0 states have call 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:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7276 states to 7276 states and 14620 transitions. [2022-03-03 18:31:01,144 INFO L78 Accepts]: Start accepts. Automaton has 7276 states and 14620 transitions. Word has length 134 [2022-03-03 18:31:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:31:01,144 INFO L470 AbstractCegarLoop]: Abstraction has 7276 states and 14620 transitions. [2022-03-03 18:31:01,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call 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:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 7276 states and 14620 transitions. [2022-03-03 18:31:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:31:01,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:31:01,146 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:01,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-03-03 18:31:01,356 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:31:01,357 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:31:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:31:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 310193071, now seen corresponding path program 17 times [2022-03-03 18:31:01,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:31:01,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989031631] [2022-03-03 18:31:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:31:01,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:31:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:31:02,581 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:31:02,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:31:02,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989031631] [2022-03-03 18:31:02,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989031631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:31:02,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621019600] [2022-03-03 18:31:02,581 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:31:02,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:31:02,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:31:02,583 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:31:02,583 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:31:03,222 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:31:03,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:31:03,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:31:03,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:31:05,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:31:06,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:06,119 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:31:06,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:06,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:06,567 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:31:07,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,199 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:31:07,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:07,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-03 18:31:08,072 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:31:08,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:31:11,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:11,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:13,072 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:31:13,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621019600] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:31:13,073 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:31:13,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:31:13,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092296085] [2022-03-03 18:31:13,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:31:13,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:31:13,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:31:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:31:13,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:31:13,074 INFO L87 Difference]: Start difference. First operand 7276 states and 14620 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:31:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:31:23,682 INFO L93 Difference]: Finished difference Result 8315 states and 16611 transitions. [2022-03-03 18:31:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:31:23,682 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:31:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:31:23,691 INFO L225 Difference]: With dead ends: 8315 [2022-03-03 18:31:23,691 INFO L226 Difference]: Without dead ends: 8315 [2022-03-03 18:31:23,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=594, Invalid=2712, Unknown=0, NotChecked=0, Total=3306 [2022-03-03 18:31:23,692 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 1459 mSDsluCounter, 5444 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 5894 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1151 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:31:23,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1459 Valid, 5894 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2361 Invalid, 0 Unknown, 1151 Unchecked, 7.6s Time] [2022-03-03 18:31:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8315 states. [2022-03-03 18:31:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8315 to 7232. [2022-03-03 18:31:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 7219 states have (on average 2.013021194071201) internal successors, (14532), 7231 states have internal predecessors, (14532), 0 states have call successors, (0), 0 states have call 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:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 14532 transitions. [2022-03-03 18:31:23,768 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 14532 transitions. Word has length 134 [2022-03-03 18:31:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:31:23,768 INFO L470 AbstractCegarLoop]: Abstraction has 7232 states and 14532 transitions. [2022-03-03 18:31:23,769 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:31:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 14532 transitions. [2022-03-03 18:31:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:31:23,771 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:31:23,771 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:23,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-03-03 18:31:23,972 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:31:23,972 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:31:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:31:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -468459355, now seen corresponding path program 18 times [2022-03-03 18:31:23,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:31:23,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474202928] [2022-03-03 18:31:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:31:23,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:31:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:31:25,158 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:31:25,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:31:25,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474202928] [2022-03-03 18:31:25,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474202928] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:31:25,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49171633] [2022-03-03 18:31:25,158 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:31:25,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:31:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:31:25,159 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:31:25,160 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:31:25,498 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:31:25,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:31:25,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:31:25,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:31:26,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:31:26,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:31:27,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,528 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:31:27,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:31:27,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:27,942 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:31:28,497 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:31:28,498 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:31:28,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:28,882 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:31:29,060 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:31:29,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:31:32,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:32,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:31:33,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:33,128 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:31:33,844 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:31:33,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49171633] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:31:33,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:31:33,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:31:33,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290198429] [2022-03-03 18:31:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:31:33,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:31:33,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:31:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:31:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:31:33,845 INFO L87 Difference]: Start difference. First operand 7232 states and 14532 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:31:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:31:37,531 INFO L93 Difference]: Finished difference Result 9217 states and 18518 transitions. [2022-03-03 18:31:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:31:37,532 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:31:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:31:37,543 INFO L225 Difference]: With dead ends: 9217 [2022-03-03 18:31:37,543 INFO L226 Difference]: Without dead ends: 9217 [2022-03-03 18:31:37,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:31:37,544 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 234 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:31:37,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 1575 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 511 Unchecked, 0.9s Time] [2022-03-03 18:31:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2022-03-03 18:31:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 7250. [2022-03-03 18:31:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7250 states, 7237 states have (on average 2.012988807516927) internal successors, (14568), 7249 states have internal predecessors, (14568), 0 states have call successors, (0), 0 states have call 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:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7250 states to 7250 states and 14568 transitions. [2022-03-03 18:31:37,665 INFO L78 Accepts]: Start accepts. Automaton has 7250 states and 14568 transitions. Word has length 134 [2022-03-03 18:31:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:31:37,665 INFO L470 AbstractCegarLoop]: Abstraction has 7250 states and 14568 transitions. [2022-03-03 18:31:37,665 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:31:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7250 states and 14568 transitions. [2022-03-03 18:31:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:31:37,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:31:37,667 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:37,685 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:31:37,867 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:31:37,868 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:31:37,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:31:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash -552304441, now seen corresponding path program 19 times [2022-03-03 18:31:37,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:31:37,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857190917] [2022-03-03 18:31:37,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:31:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:31:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:31:39,017 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:31:39,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:31:39,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857190917] [2022-03-03 18:31:39,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857190917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:31:39,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911053247] [2022-03-03 18:31:39,017 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:31:39,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:31:39,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:31:39,019 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:31:39,021 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:31:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:31:39,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:31:39,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:31:41,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:31:41,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:41,756 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:31:41,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:41,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:41,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:41,977 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:31:42,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:42,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:42,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:42,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:42,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:31:42,447 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:31:42,958 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:31:42,959 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:31:43,136 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:31:43,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:32:22,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |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:32:24,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7502 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_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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_7502 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7502 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_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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_7502 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_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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-03 18:32:59,698 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:32:59,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911053247] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:32:59,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:32:59,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-03 18:32:59,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319731847] [2022-03-03 18:32:59,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:32:59,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:32:59,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:32:59,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:32:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1233, Unknown=32, NotChecked=146, Total=1560 [2022-03-03 18:32:59,700 INFO L87 Difference]: Start difference. First operand 7250 states and 14568 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:10,474 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) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7502 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_7502 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 (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 .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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7502 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_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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_7502 Int)) (= |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_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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~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:33:12,815 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_7502 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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .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|)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-03-03 18:33:19,486 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))) (<= 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|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7502 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7502 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 (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_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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7502 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (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|) .cse6 |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_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)))) (forall ((v_ArrVal_7502 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse7 (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|) .cse8 |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 .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7502))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~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:33:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:33,055 INFO L93 Difference]: Finished difference Result 14716 states and 29503 transitions. [2022-03-03 18:33:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-03 18:33:33,055 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:33:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:33,073 INFO L225 Difference]: With dead ends: 14716 [2022-03-03 18:33:33,073 INFO L226 Difference]: Without dead ends: 14716 [2022-03-03 18:33:33,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 99.7s TimeCoverageRelationStatistics Valid=469, Invalid=3049, Unknown=42, NotChecked=600, Total=4160 [2022-03-03 18:33:33,074 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 2223 mSDsluCounter, 6237 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 6690 SdHoareTripleChecker+Invalid, 5121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1904 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:33,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2223 Valid, 6690 Invalid, 5121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 3075 Invalid, 0 Unknown, 1904 Unchecked, 10.0s Time] [2022-03-03 18:33:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14716 states. [2022-03-03 18:33:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14716 to 7248. [2022-03-03 18:33:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7235 states have (on average 2.012992398064962) internal successors, (14564), 7247 states have internal predecessors, (14564), 0 states have call successors, (0), 0 states have call 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:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 14564 transitions. [2022-03-03 18:33:33,201 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 14564 transitions. Word has length 134 [2022-03-03 18:33:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:33,201 INFO L470 AbstractCegarLoop]: Abstraction has 7248 states and 14564 transitions. [2022-03-03 18:33:33,201 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:33:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 14564 transitions. [2022-03-03 18:33:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:33:33,204 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:33,204 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:33,231 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:33:33,428 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:33:33,429 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:33:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1227182707, now seen corresponding path program 20 times [2022-03-03 18:33:33,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:33,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685308371] [2022-03-03 18:33:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:34,592 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:34,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:34,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685308371] [2022-03-03 18:33:34,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685308371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:33:34,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640423540] [2022-03-03 18:33:34,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:33:34,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:33:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:33:34,594 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:33:34,595 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:33:34,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:33:34,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:33:34,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:33:34,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:33:35,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:33:36,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:33:37,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,100 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:37,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,354 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:37,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:37,816 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:38,102 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:33:38,103 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:38,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:38,478 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:38,652 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:38,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:33:41,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:41,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:42,720 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:43,464 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:43,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640423540] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:33:43,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:33:43,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:33:43,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505991439] [2022-03-03 18:33:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:43,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:33:43,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:33:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:33:43,465 INFO L87 Difference]: Start difference. First operand 7248 states and 14564 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:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:46,966 INFO L93 Difference]: Finished difference Result 9162 states and 18383 transitions. [2022-03-03 18:33:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:33:46,966 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:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:47,000 INFO L225 Difference]: With dead ends: 9162 [2022-03-03 18:33:47,000 INFO L226 Difference]: Without dead ends: 9162 [2022-03-03 18:33:47,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2022-03-03 18:33:47,001 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 217 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1084 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:47,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 2180 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 1084 Unchecked, 0.7s Time] [2022-03-03 18:33:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9162 states. [2022-03-03 18:33:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9162 to 7248. [2022-03-03 18:33:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7235 states have (on average 2.012992398064962) internal successors, (14564), 7247 states have internal predecessors, (14564), 0 states have call successors, (0), 0 states have call 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:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 14564 transitions. [2022-03-03 18:33:47,072 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 14564 transitions. Word has length 134 [2022-03-03 18:33:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:47,072 INFO L470 AbstractCegarLoop]: Abstraction has 7248 states and 14564 transitions. [2022-03-03 18:33:47,072 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:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 14564 transitions. [2022-03-03 18:33:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:33:47,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:47,075 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:47,092 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:33:47,275 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:33:47,275 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:33:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -562247587, now seen corresponding path program 21 times [2022-03-03 18:33:47,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:47,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910699759] [2022-03-03 18:33:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:48,450 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:48,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:48,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910699759] [2022-03-03 18:33:48,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910699759] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:33:48,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804520244] [2022-03-03 18:33:48,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:33:48,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:33:48,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:33:48,452 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:33:48,452 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:33:48,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:33:48,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:33:48,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:33:48,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:33:49,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:33:50,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:51,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:51,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:33:51,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:51,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:51,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:51,273 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:51,729 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:33:51,729 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:51,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:51,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:51,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:51,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,006 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:52,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:52,411 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:52,587 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:52,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:33:55,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:55,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:33:56,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:56,951 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:57,693 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:57,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804520244] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:33:57,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:33:57,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:33:57,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145838604] [2022-03-03 18:33:57,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:57,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:33:57,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:57,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:33:57,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:33:57,695 INFO L87 Difference]: Start difference. First operand 7248 states and 14564 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:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:02,087 INFO L93 Difference]: Finished difference Result 9184 states and 18453 transitions. [2022-03-03 18:34:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:34:02,087 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:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:02,099 INFO L225 Difference]: With dead ends: 9184 [2022-03-03 18:34:02,099 INFO L226 Difference]: Without dead ends: 9184 [2022-03-03 18:34:02,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2022-03-03 18:34:02,099 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 242 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1009 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:02,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 1899 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 1009 Unchecked, 0.9s Time] [2022-03-03 18:34:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9184 states. [2022-03-03 18:34:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9184 to 7256. [2022-03-03 18:34:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7256 states, 7243 states have (on average 2.012978047770261) internal successors, (14580), 7255 states have internal predecessors, (14580), 0 states have call successors, (0), 0 states have call 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:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 14580 transitions. [2022-03-03 18:34:02,212 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 14580 transitions. Word has length 134 [2022-03-03 18:34:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:02,212 INFO L470 AbstractCegarLoop]: Abstraction has 7256 states and 14580 transitions. [2022-03-03 18:34:02,212 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:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 14580 transitions. [2022-03-03 18:34:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:34:02,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:02,215 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:02,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-03-03 18:34:02,417 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:34:02,417 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:34:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -539129647, now seen corresponding path program 22 times [2022-03-03 18:34:02,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:02,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951450592] [2022-03-03 18:34:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:03,503 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:03,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:03,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951450592] [2022-03-03 18:34:03,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951450592] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:03,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145927099] [2022-03-03 18:34:03,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:34:03,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:03,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:03,505 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:34:03,505 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:34:04,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:34:04,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:04,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-03 18:34:04,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:05,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:06,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:06,499 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:06,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:06,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:06,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:06,727 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:07,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:34:07,290 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:34:07,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:07,486 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:34:07,486 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:34:07,662 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:07,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:34:10,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:10,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:10,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:10,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:11,705 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:11,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145927099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:34:11,706 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:34:11,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2022-03-03 18:34:11,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959513477] [2022-03-03 18:34:11,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:34:11,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:34:11,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:34:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:34:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:34:11,707 INFO L87 Difference]: Start difference. First operand 7256 states and 14580 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:34:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:20,769 INFO L93 Difference]: Finished difference Result 8107 states and 16195 transitions. [2022-03-03 18:34:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 18:34:20,770 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:34:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:20,783 INFO L225 Difference]: With dead ends: 8107 [2022-03-03 18:34:20,783 INFO L226 Difference]: Without dead ends: 8107 [2022-03-03 18:34:20,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=533, Invalid=2547, Unknown=0, NotChecked=0, Total=3080 [2022-03-03 18:34:20,784 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 1165 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 5283 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 905 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:20,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 5283 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1998 Invalid, 0 Unknown, 905 Unchecked, 6.3s Time] [2022-03-03 18:34:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8107 states. [2022-03-03 18:34:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8107 to 7246. [2022-03-03 18:34:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7246 states, 7233 states have (on average 2.012995990598645) internal successors, (14560), 7245 states have internal predecessors, (14560), 0 states have call successors, (0), 0 states have call 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:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7246 states to 7246 states and 14560 transitions. [2022-03-03 18:34:20,871 INFO L78 Accepts]: Start accepts. Automaton has 7246 states and 14560 transitions. Word has length 134 [2022-03-03 18:34:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:20,871 INFO L470 AbstractCegarLoop]: Abstraction has 7246 states and 14560 transitions. [2022-03-03 18:34:20,871 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:34:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 7246 states and 14560 transitions. [2022-03-03 18:34:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:34:20,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:20,874 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:20,892 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:34:21,074 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:34:21,074 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:34:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 299090341, now seen corresponding path program 23 times [2022-03-03 18:34:21,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:21,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363678374] [2022-03-03 18:34:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:22,373 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:22,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:22,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363678374] [2022-03-03 18:34:22,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363678374] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:22,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553120955] [2022-03-03 18:34:22,374 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:34:22,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:22,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:22,375 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:34:22,376 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:34:22,870 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-03 18:34:22,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:22,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:34:22,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:24,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:25,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:25,448 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:25,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:25,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:25,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:25,853 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:26,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,115 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:26,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:26,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:34:26,517 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:26,693 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:26,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:34:30,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:30,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:32,222 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:32,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553120955] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:34:32,223 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:34:32,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-03 18:34:32,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778659399] [2022-03-03 18:34:32,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:34:32,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-03 18:34:32,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:34:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-03 18:34:32,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:34:32,224 INFO L87 Difference]: Start difference. First operand 7246 states and 14560 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:34:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:44,894 INFO L93 Difference]: Finished difference Result 8787 states and 17595 transitions. [2022-03-03 18:34:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-03 18:34:44,895 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:34:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:44,906 INFO L225 Difference]: With dead ends: 8787 [2022-03-03 18:34:44,906 INFO L226 Difference]: Without dead ends: 8787 [2022-03-03 18:34:44,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=714, Invalid=3192, Unknown=0, NotChecked=0, Total=3906 [2022-03-03 18:34:44,906 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 1440 mSDsluCounter, 5487 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 5939 SdHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1176 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:44,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1440 Valid, 5939 Invalid, 3894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2599 Invalid, 0 Unknown, 1176 Unchecked, 8.4s Time] [2022-03-03 18:34:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8787 states. [2022-03-03 18:34:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8787 to 7244. [2022-03-03 18:34:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7244 states, 7231 states have (on average 2.0129995851196236) internal successors, (14556), 7243 states have internal predecessors, (14556), 0 states have call successors, (0), 0 states have call 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:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7244 states to 7244 states and 14556 transitions. [2022-03-03 18:34:45,006 INFO L78 Accepts]: Start accepts. Automaton has 7244 states and 14556 transitions. Word has length 134 [2022-03-03 18:34:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:45,006 INFO L470 AbstractCegarLoop]: Abstraction has 7244 states and 14556 transitions. [2022-03-03 18:34:45,006 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:34:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7244 states and 14556 transitions. [2022-03-03 18:34:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:34:45,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:45,009 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:45,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-03-03 18:34:45,209 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:34:45,210 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:34:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1918444487, now seen corresponding path program 24 times [2022-03-03 18:34:45,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:45,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192069149] [2022-03-03 18:34:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:46,525 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:46,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:46,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192069149] [2022-03-03 18:34:46,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192069149] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:46,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380620662] [2022-03-03 18:34:46,525 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 18:34:46,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:46,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:46,527 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:34:46,527 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:34:46,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-03 18:34:46,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:46,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-03 18:34:46,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:47,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:48,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:49,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:49,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,480 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:49,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:49,728 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:50,054 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 18:34:50,055 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:50,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:50,421 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:50,598 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:50,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:34:53,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:53,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:34:54,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:54,927 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:55,656 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:55,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380620662] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:55,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 18:34:55,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-03 18:34:55,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342015516] [2022-03-03 18:34:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:34:55,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-03 18:34:55,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:34:55,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-03 18:34:55,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 18:34:55,657 INFO L87 Difference]: Start difference. First operand 7244 states and 14556 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:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:35:00,431 INFO L93 Difference]: Finished difference Result 8787 states and 17658 transitions. [2022-03-03 18:35:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:35:00,431 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:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:35:00,442 INFO L225 Difference]: With dead ends: 8787 [2022-03-03 18:35:00,442 INFO L226 Difference]: Without dead ends: 8787 [2022-03-03 18:35:00,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=228, Invalid=1842, Unknown=0, NotChecked=0, Total=2070 [2022-03-03 18:35:00,442 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 194 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:35:00,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1470 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 373 Unchecked, 0.4s Time] [2022-03-03 18:35:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8787 states. [2022-03-03 18:35:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8787 to 7246. [2022-03-03 18:35:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7246 states, 7233 states have (on average 2.012995990598645) internal successors, (14560), 7245 states have internal predecessors, (14560), 0 states have call successors, (0), 0 states have call 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:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7246 states to 7246 states and 14560 transitions. [2022-03-03 18:35:00,522 INFO L78 Accepts]: Start accepts. Automaton has 7246 states and 14560 transitions. Word has length 134 [2022-03-03 18:35:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:35:00,522 INFO L470 AbstractCegarLoop]: Abstraction has 7246 states and 14560 transitions. [2022-03-03 18:35:00,522 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:00,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7246 states and 14560 transitions. [2022-03-03 18:35:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 18:35:00,524 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:35:00,524 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:00,542 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:35:00,725 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:35:00,725 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:35:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:35:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1711587689, now seen corresponding path program 25 times [2022-03-03 18:35:00,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:35:00,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880928625] [2022-03-03 18:35:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:35:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:35:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:35:02,027 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:02,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:35:02,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880928625] [2022-03-03 18:35:02,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880928625] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:35:02,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296782551] [2022-03-03 18:35:02,027 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 18:35:02,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:35:02,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:35:02,029 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:35:02,029 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:35:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:35:02,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:35:02,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:35:04,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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:05,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,012 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:05,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,199 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:05,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:35:05,468 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:05,997 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-03 18:35:05,997 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:06,168 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:06,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:35:10,076 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| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8421))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (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| 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|) .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|) (+ |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_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_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|)))))) is different from false Received shutdown request... [2022-03-03 18:35:12,973 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:35:12,999 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 18:35:13,201 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-03-03 18:35:13,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-03-03 18:35:13,401 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:35:13,402 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 34 known predicates. [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-03-03 18:35:13,403 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-03-03 18:35:13,405 INFO L732 BasicCegarLoop]: Path program histogram: [39, 25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:35:13,407 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 18:35:13,407 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 18:35:13,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:35:13 BasicIcfg [2022-03-03 18:35:13,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 18:35:13,409 INFO L158 Benchmark]: Toolchain (without parser) took 818213.13ms. Allocated memory was 172.0MB in the beginning and 543.2MB in the end (delta: 371.2MB). Free memory was 119.0MB in the beginning and 224.0MB in the end (delta: -105.0MB). Peak memory consumption was 267.5MB. Max. memory is 8.0GB. [2022-03-03 18:35:13,409 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 18:35:13,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.87ms. Allocated memory is still 172.0MB. Free memory was 118.8MB in the beginning and 130.4MB in the end (delta: -11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-03 18:35:13,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.02ms. Allocated memory is still 172.0MB. Free memory was 130.4MB in the beginning and 127.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 18:35:13,409 INFO L158 Benchmark]: Boogie Preprocessor took 57.63ms. Allocated memory is still 172.0MB. Free memory was 127.6MB in the beginning and 125.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 18:35:13,409 INFO L158 Benchmark]: RCFGBuilder took 517.86ms. Allocated memory is still 172.0MB. Free memory was 125.5MB in the beginning and 109.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-03 18:35:13,409 INFO L158 Benchmark]: TraceAbstraction took 816952.21ms. Allocated memory was 172.0MB in the beginning and 543.2MB in the end (delta: 371.2MB). Free memory was 109.4MB in the beginning and 224.0MB in the end (delta: -114.6MB). Peak memory consumption was 257.9MB. Max. memory is 8.0GB. [2022-03-03 18:35:13,410 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.13ms. Allocated memory is still 172.0MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 604.87ms. Allocated memory is still 172.0MB. Free memory was 118.8MB in the beginning and 130.4MB in the end (delta: -11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.02ms. Allocated memory is still 172.0MB. Free memory was 130.4MB in the beginning and 127.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.63ms. Allocated memory is still 172.0MB. Free memory was 127.6MB in the beginning and 125.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 517.86ms. Allocated memory is still 172.0MB. Free memory was 125.5MB in the beginning and 109.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 816952.21ms. Allocated memory was 172.0MB in the beginning and 543.2MB in the end (delta: 371.2MB). Free memory was 109.4MB in the beginning and 224.0MB in the end (delta: -114.6MB). Peak memory consumption was 257.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 34 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 34 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 34 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 34 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 34 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 34 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 34 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: 816.8s, OverallIterations: 77, TraceHistogramMax: 10, PathProgramHistogramMax: 39, EmptinessCheckTime: 0.2s, AutomataDifference: 235.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67841 SdHoareTripleChecker+Valid, 106.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67841 mSDsluCounter, 172833 SdHoareTripleChecker+Invalid, 97.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30289 IncrementalHoareTripleChecker+Unchecked, 148564 mSDsCounter, 2030 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74467 IncrementalHoareTripleChecker+Invalid, 106786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2030 mSolverCounterUnsat, 24536 mSDtfsCounter, 74467 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13458 GetRequests, 10657 SyntacticMatches, 17 SemanticMatches, 2784 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 30291 ImplicationChecksByTransitivity, 539.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7321occurred in iteration=51, InterpolantAutomatonStates: 1553, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 76 MinimizatonAttempts, 356715 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 527.8s InterpolantComputationTime, 16062 NumberOfCodeBlocks, 14040 NumberOfCodeBlocksAsserted, 257 NumberOfCheckSat, 19381 ConstructedInterpolants, 310 QuantifiedInterpolants, 160116 SizeOfPredicates, 844 NumberOfNonLiveVariables, 15672 ConjunctsInSsa, 2230 ConjunctsInUnsatCore, 175 InterpolantComputations, 60 PerfectInterpolantSequences, 36680/39313 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