/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-MCRwithDepranks-Lazy-NoForkJoinOpt.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_03-funloop_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-16 10:13:11,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-16 10:13:11,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-16 10:13:11,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-16 10:13:11,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-16 10:13:11,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-16 10:13:11,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-16 10:13:11,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-16 10:13:11,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-16 10:13:11,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-16 10:13:11,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-16 10:13:11,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-16 10:13:11,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-16 10:13:11,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-16 10:13:11,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-16 10:13:11,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-16 10:13:11,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-16 10:13:11,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-16 10:13:11,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-16 10:13:11,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-16 10:13:11,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-16 10:13:11,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-16 10:13:11,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-16 10:13:11,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-16 10:13:11,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-16 10:13:11,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-16 10:13:11,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-16 10:13:11,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-16 10:13:11,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-16 10:13:11,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-16 10:13:11,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-16 10:13:11,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-16 10:13:11,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-16 10:13:11,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-16 10:13:11,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-16 10:13:11,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-16 10:13:11,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-16 10:13:11,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-16 10:13:11,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-16 10:13:11,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-16 10:13:11,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-16 10:13:11,970 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-MCRwithDepranks-Lazy-NoForkJoinOpt.epf [2022-03-16 10:13:11,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-16 10:13:11,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-16 10:13:11,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-16 10:13:11,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-16 10:13:11,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-16 10:13:11,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-16 10:13:11,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-16 10:13:11,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-16 10:13:12,002 INFO L138 SettingsManager]: * Use SBE=true [2022-03-16 10:13:12,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-16 10:13:12,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-16 10:13:12,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-16 10:13:12,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-16 10:13:12,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-16 10:13:12,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-16 10:13:12,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-16 10:13:12,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-16 10:13:12,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-16 10:13:12,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-16 10:13:12,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-16 10:13:12,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-16 10:13:12,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-16 10:13:12,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-16 10:13:12,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-16 10:13:12,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-16 10:13:12,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-16 10:13:12,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-16 10:13:12,006 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-16 10:13:12,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-16 10:13:12,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-16 10:13:12,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-16 10:13:12,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-16 10:13:12,007 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-16 10:13:12,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-16 10:13:12,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-16 10:13:12,007 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-16 10:13:12,007 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-16 10:13:12,007 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-16 10:13:12,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-16 10:13:12,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-16 10:13:12,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-16 10:13:12,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-16 10:13:12,250 INFO L275 PluginConnector]: CDTParser initialized [2022-03-16 10:13:12,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-03-16 10:13:12,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0786c2c65/16f34fd4a01a4dadbb86a35c8cc2611d/FLAG1eaadad1f [2022-03-16 10:13:12,709 INFO L306 CDTParser]: Found 1 translation units. [2022-03-16 10:13:12,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-03-16 10:13:12,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0786c2c65/16f34fd4a01a4dadbb86a35c8cc2611d/FLAG1eaadad1f [2022-03-16 10:13:12,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0786c2c65/16f34fd4a01a4dadbb86a35c8cc2611d [2022-03-16 10:13:12,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-16 10:13:12,754 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-16 10:13:12,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-16 10:13:12,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-16 10:13:12,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-16 10:13:12,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:13:12" (1/1) ... [2022-03-16 10:13:12,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d103b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:12, skipping insertion in model container [2022-03-16 10:13:12,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:13:12" (1/1) ... [2022-03-16 10:13:12,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-16 10:13:12,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-16 10:13:13,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-16 10:13:13,217 INFO L203 MainTranslator]: Completed pre-run [2022-03-16 10:13:13,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-16 10:13:13,291 INFO L208 MainTranslator]: Completed translation [2022-03-16 10:13:13,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13 WrapperNode [2022-03-16 10:13:13,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-16 10:13:13,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-16 10:13:13,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-16 10:13:13,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-16 10:13:13,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,345 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-03-16 10:13:13,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-16 10:13:13,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-16 10:13:13,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-16 10:13:13,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-16 10:13:13,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-16 10:13:13,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-16 10:13:13,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-16 10:13:13,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-16 10:13:13,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (1/1) ... [2022-03-16 10:13:13,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-16 10:13:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:13,416 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-16 10:13:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-16 10:13:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-16 10:13:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-16 10:13:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-16 10:13:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-16 10:13:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-16 10:13:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-16 10:13:13,461 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-16 10:13:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-16 10:13:13,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-16 10:13:13,462 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-16 10:13:13,447 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-16 10:13:13,616 INFO L234 CfgBuilder]: Building ICFG [2022-03-16 10:13:13,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-16 10:13:13,822 INFO L275 CfgBuilder]: Performing block encoding [2022-03-16 10:13:13,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-16 10:13:13,829 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-16 10:13:13,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.03 10:13:13 BoogieIcfgContainer [2022-03-16 10:13:13,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-16 10:13:13,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-16 10:13:13,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-16 10:13:13,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-16 10:13:13,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:13:12" (1/3) ... [2022-03-16 10:13:13,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38994e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:13:13, skipping insertion in model container [2022-03-16 10:13:13,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:13:13" (2/3) ... [2022-03-16 10:13:13,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38994e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:13:13, skipping insertion in model container [2022-03-16 10:13:13,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.03 10:13:13" (3/3) ... [2022-03-16 10:13:13,837 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-03-16 10:13:13,841 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-16 10:13:13,841 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-16 10:13:13,841 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-16 10:13:13,841 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-16 10:13:13,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,886 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-16 10:13:13,886 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-16 10:13:13,887 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,887 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-16 10:13:13,887 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-16 10:13:13,887 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-16 10:13:13,888 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-16 10:13:13,890 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-16 10:13:13,890 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-16 10:13:13,890 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-16 10:13:13,890 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-16 10:13:13,890 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-16 10:13:13,890 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-16 10:13:13,891 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-16 10:13:13,891 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-16 10:13:13,891 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-16 10:13:13,891 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-16 10:13:13,891 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-16 10:13:13,891 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-16 10:13:13,891 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-16 10:13:13,892 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-16 10:13:13,892 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-16 10:13:13,892 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-16 10:13:13,892 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-16 10:13:13,892 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-16 10:13:13,892 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-16 10:13:13,892 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-16 10:13:13,893 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-16 10:13:13,893 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-16 10:13:13,893 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-16 10:13:13,893 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-16 10:13:13,893 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-16 10:13:13,894 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-16 10:13:13,894 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-16 10:13:13,894 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-16 10:13:13,894 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-16 10:13:13,894 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-16 10:13:13,894 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-16 10:13:13,894 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-16 10:13:13,895 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-16 10:13:13,895 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-16 10:13:13,895 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-16 10:13:13,895 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-16 10:13:13,895 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-16 10:13:13,895 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-16 10:13:13,895 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-16 10:13:13,896 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-16 10:13:13,896 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-16 10:13:13,896 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-16 10:13:13,896 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-16 10:13:13,896 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-16 10:13:13,896 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-16 10:13:13,897 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-16 10:13:13,897 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-16 10:13:13,897 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-16 10:13:13,897 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-16 10:13:13,897 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-16 10:13:13,898 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-16 10:13:13,898 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-16 10:13:13,898 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-16 10:13:13,898 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-16 10:13:13,899 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-16 10:13:13,899 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-16 10:13:13,899 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-16 10:13:13,899 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-16 10:13:13,900 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-16 10:13:13,900 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-16 10:13:13,900 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-16 10:13:13,900 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-16 10:13:13,900 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-16 10:13:13,900 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-16 10:13:13,901 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-16 10:13:13,901 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-16 10:13:13,901 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-16 10:13:13,901 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-16 10:13:13,901 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-16 10:13:13,901 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-16 10:13:13,902 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-16 10:13:13,902 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-16 10:13:13,902 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-16 10:13:13,902 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-16 10:13:13,902 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-16 10:13:13,903 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-16 10:13:13,903 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-16 10:13:13,904 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-16 10:13:13,904 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-16 10:13:13,904 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-16 10:13:13,904 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-16 10:13:13,904 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-16 10:13:13,904 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-16 10:13:13,905 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-16 10:13:13,905 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-16 10:13:13,905 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-16 10:13:13,905 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-16 10:13:13,905 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-16 10:13:13,905 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-16 10:13:13,906 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-16 10:13:13,906 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-16 10:13:13,906 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-16 10:13:13,906 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-16 10:13:13,906 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-16 10:13:13,906 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-16 10:13:13,907 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-16 10:13:13,907 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-16 10:13:13,907 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-16 10:13:13,907 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-16 10:13:13,908 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-16 10:13:13,908 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-16 10:13:13,908 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-16 10:13:13,908 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-16 10:13:13,908 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-16 10:13:13,909 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-16 10:13:13,909 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-16 10:13:13,909 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-16 10:13:13,909 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-16 10:13:13,909 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-16 10:13:13,909 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-16 10:13:13,910 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-16 10:13:13,910 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-16 10:13:13,910 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-16 10:13:13,922 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-16 10:13:13,923 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,923 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,923 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,923 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,923 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,923 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,924 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,924 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,924 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,924 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,927 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,927 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,928 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,928 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-16 10:13:13,928 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-16 10:13:13,928 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-16 10:13:13,928 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-16 10:13:13,928 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-16 10:13:13,928 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-16 10:13:13,928 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-16 10:13:13,929 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,929 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,929 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 10:13:13,929 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-16 10:13:13,931 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-16 10:13:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-16 10:13:13,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:13,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-03-16 10:13:13,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-03-16 10:13:14,003 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-16 10:13:14,011 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=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, 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=false, mMcrOverapproximateWrwc=true [2022-03-16 10:13:14,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-16 10:13:14,065 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-03-16 10:13:14,067 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-16 10:13:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash 397060765, now seen corresponding path program 1 times [2022-03-16 10:13:14,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:14,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957632233] [2022-03-16 10:13:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:14,233 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-16 10:13:14,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:14,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957632233] [2022-03-16 10:13:14,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957632233] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:14,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:14,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-16 10:13:14,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572078905] [2022-03-16 10:13:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:14,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-16 10:13:14,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-16 10:13:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-16 10:13:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,261 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:14,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:14,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,277 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-03-16 10:13:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-16 10:13:14,278 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-16 10:13:14,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1657093153, now seen corresponding path program 1 times [2022-03-16 10:13:14,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:14,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123796462] [2022-03-16 10:13:14,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:14,376 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-16 10:13:14,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:14,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123796462] [2022-03-16 10:13:14,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123796462] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:14,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:14,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-16 10:13:14,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176064482] [2022-03-16 10:13:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:14,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 10:13:14,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 10:13:14,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-16 10:13:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,381 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:14,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:14,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,408 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 51 transitions and produced 52 states. [2022-03-16 10:13:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:14,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-16 10:13:14,410 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-16 10:13:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1891473138, now seen corresponding path program 1 times [2022-03-16 10:13:14,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:14,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805152658] [2022-03-16 10:13:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:14,508 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-16 10:13:14,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:14,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805152658] [2022-03-16 10:13:14,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805152658] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:14,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631626920] [2022-03-16 10:13:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:14,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:14,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:14,512 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-16 10:13:14,514 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-16 10:13:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:14,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-16 10:13:14,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:14,721 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-16 10:13:14,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 10:13:14,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631626920] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:14,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 10:13:14,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-16 10:13:14,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270777249] [2022-03-16 10:13:14,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:14,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 10:13:14,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:14,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 10:13:14,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-16 10:13:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,724 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:14,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:14,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:14,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,754 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 63 transitions and produced 64 states. [2022-03-16 10:13:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:14,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-16 10:13:14,956 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,SelfDestructingSolverStorable2 [2022-03-16 10:13:14,957 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-16 10:13:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:14,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1317859348, now seen corresponding path program 1 times [2022-03-16 10:13:14,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:14,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915256903] [2022-03-16 10:13:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:15,036 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-16 10:13:15,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:15,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915256903] [2022-03-16 10:13:15,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915256903] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:15,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674320054] [2022-03-16 10:13:15,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:15,039 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-16 10:13:15,040 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-16 10:13:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:15,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-16 10:13:15,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:15,270 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-16 10:13:15,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:13:15,368 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-16 10:13:15,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674320054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:13:15,368 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:13:15,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-16 10:13:15,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392276822] [2022-03-16 10:13:15,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:13:15,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-16 10:13:15,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-16 10:13:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-16 10:13:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:15,371 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:15,371 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-16 10:13:15,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:15,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:15,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:15,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:15,479 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 77 transitions and produced 78 states. [2022-03-16 10:13:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:15,502 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-16 10:13:15,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:15,696 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-16 10:13:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash -626594124, now seen corresponding path program 2 times [2022-03-16 10:13:15,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:15,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099384091] [2022-03-16 10:13:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:15,800 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-16 10:13:15,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:15,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099384091] [2022-03-16 10:13:15,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099384091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:15,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867830359] [2022-03-16 10:13:15,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 10:13:15,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:15,804 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-16 10:13:15,841 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-16 10:13:15,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 10:13:15,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 10:13:15,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-16 10:13:15,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:15,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-16 10:13:16,021 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-16 10:13:16,023 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-16 10:13:16,070 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-16 10:13:16,070 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-16 10:13:16,170 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-16 10:13:16,171 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-16 10:13:16,195 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-16 10:13:16,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 10:13:16,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867830359] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:16,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 10:13:16,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-16 10:13:16,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905070560] [2022-03-16 10:13:16,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:16,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 10:13:16,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 10:13:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-16 10:13:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:16,203 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:16,203 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-16 10:13:16,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:16,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:16,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:16,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:16,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:16,260 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 94 transitions and produced 95 states. [2022-03-16 10:13:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:16,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-16 10:13:16,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:16,475 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1568821428, now seen corresponding path program 1 times [2022-03-16 10:13:16,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:16,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876364748] [2022-03-16 10:13:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:16,582 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-16 10:13:16,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:16,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876364748] [2022-03-16 10:13:16,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876364748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:16,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487009263] [2022-03-16 10:13:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:16,588 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-16 10:13:16,589 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-16 10:13:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:16,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-16 10:13:16,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:16,781 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-16 10:13:16,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:13:16,960 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-16 10:13:16,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487009263] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:13:16,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:13:16,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-16 10:13:16,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169587807] [2022-03-16 10:13:16,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:13:16,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-16 10:13:16,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-16 10:13:16,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-16 10:13:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:16,963 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:16,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:16,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:16,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:16,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:16,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:16,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:16,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:17,133 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 122 transitions and produced 115 states. [2022-03-16 10:13:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:17,153 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-16 10:13:17,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:17,337 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1158747276, now seen corresponding path program 2 times [2022-03-16 10:13:17,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:17,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209512726] [2022-03-16 10:13:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:17,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:17,537 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-16 10:13:17,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:17,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209512726] [2022-03-16 10:13:17,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209512726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:17,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38983031] [2022-03-16 10:13:17,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 10:13:17,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:17,540 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-16 10:13:17,543 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-16 10:13:17,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 10:13:17,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 10:13:17,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-16 10:13:17,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:17,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-16 10:13:17,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-16 10:13:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,887 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-16 10:13:17,887 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-16 10:13:17,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:17,949 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-16 10:13:17,949 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-16 10:13:17,984 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-16 10:13:17,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 10:13:17,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38983031] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:17,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 10:13:17,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-16 10:13:17,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60585078] [2022-03-16 10:13:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:17,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-16 10:13:17,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-16 10:13:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-16 10:13:17,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:17,986 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:17,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 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-16 10:13:17,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:17,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:17,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:17,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:17,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:17,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:17,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:18,212 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 155 transitions and produced 148 states. [2022-03-16 10:13:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:13:18,230 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-16 10:13:18,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:18,416 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1001729759, now seen corresponding path program 1 times [2022-03-16 10:13:18,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:18,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776883737] [2022-03-16 10:13:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-16 10:13:18,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:18,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776883737] [2022-03-16 10:13:18,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776883737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:18,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188797030] [2022-03-16 10:13:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:18,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:18,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:18,488 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-16 10:13:18,514 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-16 10:13:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:18,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-16 10:13:18,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-16 10:13:18,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:13:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-16 10:13:19,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188797030] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:13:19,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:13:19,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 24 [2022-03-16 10:13:19,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148665344] [2022-03-16 10:13:19,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:13:19,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-16 10:13:19,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:19,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-16 10:13:19,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-03-16 10:13:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,094 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:19,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:13:19,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,470 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 205 transitions and produced 193 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:19,495 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-16 10:13:19,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:19,672 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-16 10:13:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2116870732, now seen corresponding path program 1 times [2022-03-16 10:13:19,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:19,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717147521] [2022-03-16 10:13:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-03-16 10:13:19,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:19,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717147521] [2022-03-16 10:13:19,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717147521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:19,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:19,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-16 10:13:19,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102038415] [2022-03-16 10:13:19,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:19,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 10:13:19,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:19,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 10:13:19,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-16 10:13:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,846 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:19,846 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-16 10:13:19,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:19,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:19,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:19,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:19,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:19,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,914 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 238 transitions and produced 226 states. [2022-03-16 10:13:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:19,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-16 10:13:19,916 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1162619167, now seen corresponding path program 2 times [2022-03-16 10:13:19,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:19,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588455350] [2022-03-16 10:13:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:20,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:20,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588455350] [2022-03-16 10:13:20,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588455350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:20,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503713573] [2022-03-16 10:13:20,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 10:13:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:20,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:20,017 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-16 10:13:20,018 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-16 10:13:20,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 10:13:20,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 10:13:20,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-16 10:13:20,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:20,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-16 10:13:20,335 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-16 10:13:20,335 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 23 treesize of output 22 [2022-03-16 10:13:20,372 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-16 10:13:20,374 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 32 treesize of output 34 [2022-03-16 10:13:20,428 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-16 10:13:20,429 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 41 treesize of output 46 [2022-03-16 10:13:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-03-16 10:13:20,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 10:13:20,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503713573] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:20,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 10:13:20,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-03-16 10:13:20,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910186273] [2022-03-16 10:13:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:20,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 10:13:20,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 10:13:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-16 10:13:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:20,452 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:20,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:20,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:20,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:20,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:20,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:20,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:20,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:20,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:20,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:20,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:20,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:20,530 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 255 transitions and produced 243 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:20,558 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-16 10:13:20,751 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,SelfDestructingSolverStorable9 [2022-03-16 10:13:20,752 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1757402922, now seen corresponding path program 1 times [2022-03-16 10:13:20,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:20,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111217833] [2022-03-16 10:13:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:20,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:20,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:20,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111217833] [2022-03-16 10:13:20,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111217833] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:20,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036656152] [2022-03-16 10:13:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:20,852 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-16 10:13:20,854 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-16 10:13:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:21,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-16 10:13:21,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:21,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:13:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:21,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036656152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:13:21,470 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:13:21,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-16 10:13:21,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982342172] [2022-03-16 10:13:21,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:13:21,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-16 10:13:21,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-16 10:13:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-03-16 10:13:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:21,472 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:21,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.5) internal successors, (189), 14 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:21,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:21,579 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 441 transitions and produced 429 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:21,611 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-16 10:13:21,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:21,804 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -106070791, now seen corresponding path program 2 times [2022-03-16 10:13:21,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:21,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848984364] [2022-03-16 10:13:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:21,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:21,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848984364] [2022-03-16 10:13:21,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848984364] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:21,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56320760] [2022-03-16 10:13:21,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 10:13:21,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:21,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:21,987 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-16 10:13:22,013 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-16 10:13:22,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 10:13:22,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 10:13:22,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-16 10:13:22,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:22,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-16 10:13:22,400 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-16 10:13:22,401 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 23 treesize of output 22 [2022-03-16 10:13:22,431 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-16 10:13:22,432 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 32 treesize of output 34 [2022-03-16 10:13:22,478 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-16 10:13:22,479 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 41 treesize of output 46 [2022-03-16 10:13:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-03-16 10:13:22,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 10:13:22,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56320760] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:22,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 10:13:22,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-03-16 10:13:22,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861374491] [2022-03-16 10:13:22,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:22,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 10:13:22,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 10:13:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-03-16 10:13:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:22,504 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:22,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:22,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:22,610 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 476 transitions and produced 464 states. [2022-03-16 10:13:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:22,638 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-16 10:13:22,827 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,SelfDestructingSolverStorable11 [2022-03-16 10:13:22,828 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1731045646, now seen corresponding path program 1 times [2022-03-16 10:13:22,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:22,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757534776] [2022-03-16 10:13:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:23,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:23,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757534776] [2022-03-16 10:13:23,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757534776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:23,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587266468] [2022-03-16 10:13:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:23,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:23,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:23,026 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-16 10:13:23,051 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-16 10:13:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:23,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-16 10:13:23,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:23,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:13:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 10:13:24,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587266468] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:13:24,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:13:24,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-03-16 10:13:24,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364020393] [2022-03-16 10:13:24,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:13:24,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-16 10:13:24,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:24,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-16 10:13:24,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-16 10:13:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:24,113 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:24,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.608695652173912) internal successors, (359), 23 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:24,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:24,408 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 786 transitions and produced 774 states. [2022-03-16 10:13:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:24,437 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-16 10:13:24,631 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,SelfDestructingSolverStorable12 [2022-03-16 10:13:24,632 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -986440607, now seen corresponding path program 2 times [2022-03-16 10:13:24,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:24,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899290460] [2022-03-16 10:13:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:24,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:24,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899290460] [2022-03-16 10:13:24,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899290460] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:24,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:24,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-16 10:13:24,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779292242] [2022-03-16 10:13:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:24,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 10:13:24,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 10:13:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-16 10:13:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:24,882 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:24,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.2) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:24,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:24,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:24,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:25,030 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 795 transitions and produced 783 states. [2022-03-16 10:13:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-16 10:13:25,032 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-16 10:13:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1833760666, now seen corresponding path program 1 times [2022-03-16 10:13:25,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:25,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331871369] [2022-03-16 10:13:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:25,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:25,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331871369] [2022-03-16 10:13:25,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331871369] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:25,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:25,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-16 10:13:25,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229972492] [2022-03-16 10:13:25,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:25,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 10:13:25,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:25,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 10:13:25,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-16 10:13:25,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:25,356 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:25,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:25,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:25,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:25,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:25,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:25,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:26,015 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17962 transitions and produced 10076 states. [2022-03-16 10:13:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-16 10:13:26,017 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:26,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1924795105, now seen corresponding path program 1 times [2022-03-16 10:13:26,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:26,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288182128] [2022-03-16 10:13:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:26,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:26,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288182128] [2022-03-16 10:13:26,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288182128] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:26,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:26,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 10:13:26,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078684733] [2022-03-16 10:13:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:26,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 10:13:26,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 10:13:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 10:13:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:26,456 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:26,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:26,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:26,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:26,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:26,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:26,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:26,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:27,140 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17810 transitions and produced 9999 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:27,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-16 10:13:27,142 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash -460892034, now seen corresponding path program 1 times [2022-03-16 10:13:27,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:27,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635881695] [2022-03-16 10:13:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:27,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:27,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635881695] [2022-03-16 10:13:27,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635881695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:27,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:27,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 10:13:27,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940612076] [2022-03-16 10:13:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:27,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 10:13:27,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:27,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 10:13:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 10:13:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:27,578 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:27,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:27,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:28,361 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17812 transitions and produced 10004 states. [2022-03-16 10:13:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:28,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-16 10:13:28,363 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1402749280, now seen corresponding path program 1 times [2022-03-16 10:13:28,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:28,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216043056] [2022-03-16 10:13:28,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:28,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:28,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:28,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216043056] [2022-03-16 10:13:28,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216043056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:28,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:28,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 10:13:28,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601038950] [2022-03-16 10:13:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:28,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 10:13:28,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 10:13:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 10:13:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:28,881 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:28,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:28,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:28,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:29,481 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17821 transitions and produced 10013 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-16 10:13:29,482 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash -535552803, now seen corresponding path program 1 times [2022-03-16 10:13:29,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:29,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061396380] [2022-03-16 10:13:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:29,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:29,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061396380] [2022-03-16 10:13:29,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061396380] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 10:13:29,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 10:13:29,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 10:13:29,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166383392] [2022-03-16 10:13:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 10:13:29,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 10:13:29,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:13:29,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 10:13:29,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 10:13:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:29,994 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:13:29,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:13:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:32,309 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 85540 transitions and produced 46762 states. [2022-03-16 10:13:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:13:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:13:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:13:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:13:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:13:32,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-16 10:13:32,311 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:13:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:13:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2082690448, now seen corresponding path program 1 times [2022-03-16 10:13:32,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:13:32,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517521977] [2022-03-16 10:13:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:13:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:33,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:13:33,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517521977] [2022-03-16 10:13:33,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517521977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:13:33,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665914488] [2022-03-16 10:13:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:13:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:13:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:13:33,860 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-16 10:13:33,861 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-16 10:13:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:13:34,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-16 10:13:34,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:13:34,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-16 10:13:34,945 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-16 10:13:34,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-16 10:13:34,978 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-16 10:13:34,978 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 32 treesize of output 34 [2022-03-16 10:13:35,024 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-16 10:13:35,024 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 41 treesize of output 46 [2022-03-16 10:13:35,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:13:35,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:13:35,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:13:35,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:13:35,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:13:35,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:13:35,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:13:35,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:13:35,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:13:36,190 INFO L353 Elim1Store]: treesize reduction 216, result has 14.6 percent of original size [2022-03-16 10:13:36,191 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 55 treesize of output 63 [2022-03-16 10:13:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:13:36,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:14:15,773 WARN L228 SmtUtils]: Spent 11.64s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 10:14:47,034 WARN L228 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 10:14:50,124 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_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (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_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (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_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (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_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) is different from false [2022-03-16 10:14:52,359 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) is different from false [2022-03-16 10:14:54,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 141 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-03-16 10:14:56,920 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) is different from false [2022-03-16 10:15:00,221 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse0 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse1 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse2 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse3 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-03-16 10:15:02,545 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3661) .cse1 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse0 v_ArrVal_3668)) .cse1 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_3661) .cse7 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse6 v_ArrVal_3668)) .cse7 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) is different from false [2022-03-16 10:15:04,906 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) is different from false [2022-03-16 10:15:07,261 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-03-16 10:15:10,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-16 10:15:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 1550 trivial. 6 not checked. [2022-03-16 10:15:29,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665914488] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:15:29,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:15:29,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 20] total 39 [2022-03-16 10:15:29,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253899823] [2022-03-16 10:15:29,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:15:29,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-16 10:15:29,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:15:29,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-16 10:15:29,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=649, Unknown=41, NotChecked=594, Total=1560 [2022-03-16 10:15:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:15:29,524 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:15:29,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 6.641025641025641) internal successors, (259), 40 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:15:29,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:15:29,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:15:32,157 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 10:15:44,024 WARN L228 SmtUtils]: Spent 11.77s on a formula simplification. DAG size of input: 115 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 10:15:45,580 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse4 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)))) is different from false [2022-03-16 10:15:47,484 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse4 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (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_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (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_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse6) |c_ULTIMATE.start_main_#t~nondet41#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_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (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_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))))) is different from false [2022-03-16 10:15:49,792 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse17 (+ 141 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse16 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse14 (+ 142 |c_~#cache~0.offset|)) (.cse15 (+ 143 |c_~#cache~0.offset|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 1) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse2 v_ArrVal_3658) .cse3 v_ArrVal_3661) .cse4 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse2 v_ArrVal_3666)) .cse3 v_ArrVal_3668)) .cse4 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse5 v_ArrVal_3658) .cse6 v_ArrVal_3661) .cse7 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse5 v_ArrVal_3666)) .cse6 v_ArrVal_3668)) .cse7 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse8 v_ArrVal_3658) .cse9 v_ArrVal_3661) .cse10 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse8 v_ArrVal_3666)) .cse9 v_ArrVal_3668)) .cse10 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse13 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse11 v_ArrVal_3658) .cse12 v_ArrVal_3661) .cse13 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse11 v_ArrVal_3666)) .cse12 v_ArrVal_3668)) .cse13 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse14)) (= (select .cse0 .cse15) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= (select .cse16 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse16 .cse15)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1)) (= (select .cse0 .cse17) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse17)) (= (select .cse16 .cse17) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse14) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse16 .cse14) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse15)))) is different from false [2022-03-16 10:15:51,801 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 10:16:37,243 WARN L228 SmtUtils]: Spent 17.41s on a formula simplification. DAG size of input: 85 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 10:16:39,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 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_3672 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (and (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|))) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#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_3672 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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_main_#t~nondet41#1| (select (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_3672) (+ 140 |c_~#cache~0.offset|))))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#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_3672 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (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_3672 Int)) (or (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (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_3672) (+ 141 |c_~#cache~0.offset|))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))))) is different from false [2022-03-16 10:16:41,265 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |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_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |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_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))))) is different from false [2022-03-16 10:17:37,483 WARN L228 SmtUtils]: Spent 24.06s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 10:17:39,500 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (and (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|))) (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_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#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_3672)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)))))))) is different from false [2022-03-16 10:17:41,536 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 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_3672 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (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_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (and (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|))) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#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_3672 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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_main_#t~nondet41#1| (select (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_3672) (+ 140 |c_~#cache~0.offset|))))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#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_3672 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (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_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))) (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_3672 Int)) (or (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (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_3672) (+ 141 |c_~#cache~0.offset|))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_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))))) is different from false [2022-03-16 10:17:45,122 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (and (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|))) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 10:17:45,631 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 100747 transitions and produced 55963 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:17:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:17:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-16 10:17:45,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-16 10:17:45,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:17:45,834 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:17:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:17:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -138892593, now seen corresponding path program 2 times [2022-03-16 10:17:45,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:17:45,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437585415] [2022-03-16 10:17:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:17:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:17:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:17:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:17:47,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:17:47,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437585415] [2022-03-16 10:17:47,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437585415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:17:47,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184388745] [2022-03-16 10:17:47,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 10:17:47,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:17:47,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:17:47,209 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-16 10:17:47,210 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-16 10:17:47,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-16 10:17:47,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 10:17:47,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-16 10:17:47,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:17:49,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-16 10:17:49,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,115 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 23 treesize of output 22 [2022-03-16 10:17:49,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,149 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 32 treesize of output 34 [2022-03-16 10:17:49,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,192 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 41 treesize of output 46 [2022-03-16 10:17:49,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:17:49,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:17:49,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:17:49,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:17:49,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:17:49,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:17:49,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:17:49,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:49,981 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 53 treesize of output 61 [2022-03-16 10:17:50,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:17:50,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:17:50,639 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 55 treesize of output 63 [2022-03-16 10:17:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:17:50,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:17:53,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (not (<= |v_t_funThread1of1ForFork0_~i~0#1_25| (+ |c_t_funThread1of1ForFork0_#t~post34#1| 1))) (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) is different from false [2022-03-16 10:18:09,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) is different from false [2022-03-16 10:18:11,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) is different from false [2022-03-16 10:18:14,035 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|) (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) is different from false [2022-03-16 10:18:59,577 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse0 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse2 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse5 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse4 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse5 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse7 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse6 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse7 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) is different from false [2022-03-16 10:20:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:20:39,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184388745] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:20:39,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:20:39,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 17] total 36 [2022-03-16 10:20:39,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244378942] [2022-03-16 10:20:39,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:20:39,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-16 10:20:39,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:20:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-16 10:20:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=676, Unknown=52, NotChecked=320, Total=1332 [2022-03-16 10:20:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:20:39,633 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:20:39,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 7.277777777777778) internal successors, (262), 37 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:20:39,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:20:39,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:20:39,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:20:39,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:20:39,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:20:39,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:20:39,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-03-16 10:20:39,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:21:02,302 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int)) (= (select (let ((.cse5 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse5 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 10:21:08,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse10 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse4 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= |c_t_funThread1of1ForFork0_#t~post34#1| 0) (= (select .cse0 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_#t~post34#1| 0) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (not (<= |v_t_funThread1of1ForFork0_~i~0#1_25| (+ |c_t_funThread1of1ForFork0_#t~post34#1| 1))) (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse6 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse6 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse6 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse7 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse7 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse8 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse8 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse9 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse9 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse9 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) (= |c_~#cache~0.offset| 0) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse10) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse10) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)))) is different from false [2022-03-16 10:21:10,433 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 1) (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28) 1) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= (mod (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* |c_~#cache~0.offset| 27)) 28) 0))) is different from false [2022-03-16 10:21:12,440 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28) 1) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= (mod (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* |c_~#cache~0.offset| 27)) 28) 0))) is different from false [2022-03-16 10:21:14,450 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (mod (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| 27)) 28) 0) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28) 1) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 10:21:16,460 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse1 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse3 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse6 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse5 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse6 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse6 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4269 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse8 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_4269) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) .cse7 v_ArrVal_4277)) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse8 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 10:22:12,756 WARN L228 SmtUtils]: Spent 32.05s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 10:22:38,842 WARN L228 SmtUtils]: Spent 6.01s 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-16 10:23:00,166 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 145226 transitions and produced 80250 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:23:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:23:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:23:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-16 10:23:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:23:00,194 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-16 10:23:00,387 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,SelfDestructingSolverStorable20 [2022-03-16 10:23:00,388 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:23:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:23:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash -534095157, now seen corresponding path program 3 times [2022-03-16 10:23:00,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:23:00,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472544227] [2022-03-16 10:23:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:23:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:23:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:23:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:23:01,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:23:01,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472544227] [2022-03-16 10:23:01,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472544227] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:23:01,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354080565] [2022-03-16 10:23:01,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-16 10:23:01,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:23:01,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:23:01,793 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-16 10:23:01,793 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-16 10:23:02,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-16 10:23:02,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 10:23:02,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-16 10:23:02,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 10:23:03,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-16 10:23:03,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,647 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 23 treesize of output 22 [2022-03-16 10:23:03,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-03-16 10:23:03,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:03,718 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 41 treesize of output 46 [2022-03-16 10:23:04,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:23:04,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:04,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:04,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:04,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:23:04,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:04,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:04,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,431 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 53 treesize of output 61 [2022-03-16 10:23:04,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 10:23:04,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:04,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:04,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:05,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 10:23:05,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 10:23:05,154 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 55 treesize of output 63 [2022-03-16 10:23:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:23:05,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 10:23:07,167 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (and (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-16 10:23:15,452 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:17,693 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:20,632 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|))))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)))))) is different from false [2022-03-16 10:23:22,808 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:24,961 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|))))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:27,136 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:30,046 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) .cse0 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) .cse2 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|))))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse5 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) .cse4 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) .cse6 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:32,329 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_4895) .cse1 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) .cse0 v_ArrVal_4903)) .cse1 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse5 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_4895) .cse4 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) .cse3 v_ArrVal_4903)) .cse4 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_4895) .cse7 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) .cse6 v_ArrVal_4903)) .cse7 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 v_ArrVal_4895) .cse10 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) .cse9 v_ArrVal_4903)) .cse10 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:34,580 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_4893) .cse1 v_ArrVal_4895) .cse2 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse0 v_ArrVal_4901)) .cse1 v_ArrVal_4903)) .cse2 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4895) .cse6 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse4 v_ArrVal_4901)) .cse5 v_ArrVal_4903)) .cse6 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_4893) .cse9 v_ArrVal_4895) .cse10 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse8 v_ArrVal_4901)) .cse9 v_ArrVal_4903)) .cse10 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse15 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 v_ArrVal_4893) .cse13 v_ArrVal_4895) .cse14 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse12 v_ArrVal_4901)) .cse13 v_ArrVal_4903)) .cse14 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:36,822 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4893) .cse1 v_ArrVal_4895) .cse2 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse0 v_ArrVal_4901)) .cse1 v_ArrVal_4903)) .cse2 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4895) .cse6 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse4 v_ArrVal_4901)) .cse5 v_ArrVal_4903)) .cse6 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse8 v_ArrVal_4893) .cse9 v_ArrVal_4895) .cse10 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse8 v_ArrVal_4901)) .cse9 v_ArrVal_4903)) .cse10 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse15 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse12 v_ArrVal_4893) .cse13 v_ArrVal_4895) .cse14 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse12 v_ArrVal_4901)) .cse13 v_ArrVal_4903)) .cse14 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:39,861 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4893) .cse1 v_ArrVal_4895) .cse2 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse0 v_ArrVal_4901)) .cse1 v_ArrVal_4903)) .cse2 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4895) .cse6 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse4 v_ArrVal_4901)) .cse5 v_ArrVal_4903)) .cse6 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse8 v_ArrVal_4893) .cse9 v_ArrVal_4895) .cse10 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse8 v_ArrVal_4901)) .cse9 v_ArrVal_4903)) .cse10 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse15 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse12 v_ArrVal_4893) .cse13 v_ArrVal_4895) .cse14 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse12 v_ArrVal_4901)) .cse13 v_ArrVal_4903)) .cse14 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-03-16 10:23:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 1550 trivial. 14 not checked. [2022-03-16 10:23:44,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354080565] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 10:23:44,340 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 10:23:44,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 21] total 40 [2022-03-16 10:23:44,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191339622] [2022-03-16 10:23:44,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 10:23:44,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-16 10:23:44,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:23:44,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-16 10:23:44,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=579, Unknown=16, NotChecked=780, Total=1640 [2022-03-16 10:23:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:23:44,342 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:23:44,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.075) internal successors, (283), 41 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:23:44,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:44,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:23:44,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:44,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:44,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:23:44,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:23:44,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-03-16 10:23:44,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:23:44,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:23:46,673 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4893) .cse1 v_ArrVal_4895) .cse2 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse0 v_ArrVal_4901)) .cse1 v_ArrVal_4903)) .cse2 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse4 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (and (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= |c_~#cache~0.base| 1) (= (select .cse4 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse5 v_ArrVal_4893) .cse6 v_ArrVal_4895) .cse7 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse5 v_ArrVal_4901)) .cse6 v_ArrVal_4903)) .cse7 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse12 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse9 v_ArrVal_4893) .cse10 v_ArrVal_4895) .cse11 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse9 v_ArrVal_4901)) .cse10 v_ArrVal_4903)) .cse11 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse4 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse16 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse15 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse13 v_ArrVal_4893) .cse14 v_ArrVal_4895) .cse15 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse13 v_ArrVal_4901)) .cse14 v_ArrVal_4903)) .cse15 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:23:49,300 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:23:51,305 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse5 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse8 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse5 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse5 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse5 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse8) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse9 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse9 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse9 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse10 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse10 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse10 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse5 .cse8) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)))) is different from false [2022-03-16 10:23:53,310 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:23:55,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_t_funThread1of1ForFork0_#t~post34#1| 0) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_#t~post34#1| 0) (= |c_~#cache~0.offset| 0) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4915 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:23:57,324 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_~#cache~0.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 1) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4893) .cse1 v_ArrVal_4895) .cse2 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse0 v_ArrVal_4901)) .cse1 v_ArrVal_4903)) .cse2 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse4 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (and (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= |c_~#cache~0.base| 1) (= (select .cse4 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse5 v_ArrVal_4893) .cse6 v_ArrVal_4895) .cse7 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse5 v_ArrVal_4901)) .cse6 v_ArrVal_4903)) .cse7 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse12 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse9 v_ArrVal_4893) .cse10 v_ArrVal_4895) .cse11 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse9 v_ArrVal_4901)) .cse10 v_ArrVal_4903)) .cse11 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse4 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse16 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse15 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse13 v_ArrVal_4893) .cse14 v_ArrVal_4895) .cse15 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse13 v_ArrVal_4901)) .cse14 v_ArrVal_4903)) .cse15 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:23:59,338 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4893) .cse1 v_ArrVal_4895) .cse2 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse0 v_ArrVal_4901)) .cse1 v_ArrVal_4903)) .cse2 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse4 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (and (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= |c_~#cache~0.base| 1) (= (select .cse4 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse5 v_ArrVal_4893) .cse6 v_ArrVal_4895) .cse7 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse5 v_ArrVal_4901)) .cse6 v_ArrVal_4903)) .cse7 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse12 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse9 v_ArrVal_4893) .cse10 v_ArrVal_4895) .cse11 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse9 v_ArrVal_4901)) .cse10 v_ArrVal_4903)) .cse11 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse4 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse16 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse15 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse13 v_ArrVal_4893) .cse14 v_ArrVal_4895) .cse15 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4898) .cse13 v_ArrVal_4901)) .cse14 v_ArrVal_4903)) .cse15 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:25:01,878 WARN L228 SmtUtils]: Spent 50.29s on a formula simplification. DAG size of input: 90 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 10:25:14,012 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse1 v_ArrVal_4893) .cse2 v_ArrVal_4895) .cse3 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse1 v_ArrVal_4901)) .cse2 v_ArrVal_4903)) .cse3 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse10 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (let ((.cse9 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse8 (+ 3 .cse9 |c_~#cache~0.offset|))) (store (let ((.cse7 (+ 2 .cse9 |c_~#cache~0.offset|))) (store (let ((.cse6 (+ .cse9 |c_~#cache~0.offset| 1))) (store (let ((.cse5 (+ .cse9 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse5 v_ArrVal_4890) .cse6 v_ArrVal_4893) .cse7 v_ArrVal_4895) .cse8 v_ArrVal_4896) .cse5 v_ArrVal_4898)) .cse6 v_ArrVal_4901)) .cse7 v_ArrVal_4903)) .cse8 v_ArrVal_4904))) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse10 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse10 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse14 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse11 v_ArrVal_4893) .cse12 v_ArrVal_4895) .cse13 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse11 v_ArrVal_4901)) .cse12 v_ArrVal_4903)) .cse13 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse14 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse14 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse20 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (let ((.cse19 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse18 (+ 3 .cse19 |c_~#cache~0.offset|))) (store (let ((.cse17 (+ 2 .cse19 |c_~#cache~0.offset|))) (store (let ((.cse16 (+ .cse19 |c_~#cache~0.offset| 1))) (store (let ((.cse15 (+ .cse19 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse15 v_ArrVal_4890) .cse16 v_ArrVal_4893) .cse17 v_ArrVal_4895) .cse18 v_ArrVal_4896) .cse15 v_ArrVal_4898)) .cse16 v_ArrVal_4901)) .cse17 v_ArrVal_4903)) .cse18 v_ArrVal_4904))) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse20 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse20 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse26 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (let ((.cse25 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse24 (+ 3 .cse25 |c_~#cache~0.offset|))) (store (let ((.cse23 (+ 2 .cse25 |c_~#cache~0.offset|))) (store (let ((.cse22 (+ .cse25 |c_~#cache~0.offset| 1))) (store (let ((.cse21 (+ .cse25 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse21 v_ArrVal_4890) .cse22 v_ArrVal_4893) .cse23 v_ArrVal_4895) .cse24 v_ArrVal_4896) .cse21 v_ArrVal_4898)) .cse22 v_ArrVal_4901)) .cse23 v_ArrVal_4903)) .cse24 v_ArrVal_4904))) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse26 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse26 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse30 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse29 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse28 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse27 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse27 v_ArrVal_4893) .cse28 v_ArrVal_4895) .cse29 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse27 v_ArrVal_4901)) .cse28 v_ArrVal_4903)) .cse29 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse30 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse30 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse34 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse33 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse32 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse31 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse31 v_ArrVal_4893) .cse32 v_ArrVal_4895) .cse33 v_ArrVal_4896) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) .cse31 v_ArrVal_4901)) .cse32 v_ArrVal_4903)) .cse33 v_ArrVal_4904))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse34 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse34 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (v_ArrVal_4895 Int) (v_ArrVal_4896 Int) (v_ArrVal_4893 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse40 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (let ((.cse39 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse38 (+ 3 .cse39 |c_~#cache~0.offset|))) (store (let ((.cse37 (+ 2 .cse39 |c_~#cache~0.offset|))) (store (let ((.cse36 (+ .cse39 |c_~#cache~0.offset| 1))) (store (let ((.cse35 (+ .cse39 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse35 v_ArrVal_4890) .cse36 v_ArrVal_4893) .cse37 v_ArrVal_4895) .cse38 v_ArrVal_4896) .cse35 v_ArrVal_4898)) .cse36 v_ArrVal_4901)) .cse37 v_ArrVal_4903)) .cse38 v_ArrVal_4904))) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse40 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse40 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:26:16,044 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse1 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse1 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse1 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.offset| 0) (= (select .cse1 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (v_ArrVal_4898 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4898) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-03-16 10:26:18,052 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 141 |c_~#cache~0.offset|))))) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_4903 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4904 Int) (v_ArrVal_4915 Int) (v_ArrVal_4901 Int) (v_ArrVal_4912 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4901) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4903) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4904)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4912) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4915)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 10:26:19,046 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (and (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (and (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915) (+ 140 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4915 Int) (v_ArrVal_4912 Int)) (= (select (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4912) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4915) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|)))) is different from false [2022-03-16 10:26:22,879 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 147103 transitions and produced 81661 states. [2022-03-16 10:26:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:26:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:26:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:26:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:26:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:26:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:26:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:26:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-16 10:26:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:26:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-16 10:26:22,900 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-16 10:26:23,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:26:23,085 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 10:26:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 10:26:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash 622921451, now seen corresponding path program 4 times [2022-03-16 10:26:23,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 10:26:23,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466461261] [2022-03-16 10:26:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 10:26:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 10:26:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 10:26:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 10:26:24,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 10:26:24,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466461261] [2022-03-16 10:26:24,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466461261] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 10:26:24,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428365345] [2022-03-16 10:26:24,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-16 10:26:24,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:26:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 10:26:24,667 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-16 10:26:24,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process Received shutdown request... [2022-03-16 10:27:25,041 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-16 10:27:25,041 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-16 10:27:25,041 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-16 10:27:26,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-03-16 10:27:26,242 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forcibly destroying the process [2022-03-16 10:27:26,242 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-16 10:27:26,257 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-16 10:27:26,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-16 10:27:26,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-03-16 10:27:26,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863098519] [2022-03-16 10:27:26,257 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-16 10:27:26,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-16 10:27:26,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 10:27:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-16 10:27:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2022-03-16 10:27:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:27:26,258 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 10:27:26,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:27:26,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:27:26,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 10:27:26,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-16 10:27:26,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-03-16 10:27:26,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 10:27:26,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-03-16 10:27:26,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 10:27:26,262 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forcibly destroying the process [2022-03-16 10:27:26,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 10:27:26,262 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-03-16 10:27:26,264 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-03-16 10:27:26,269 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-03-16 10:27:26,269 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-03-16 10:27:26,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-03-16 10:27:26,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-03-16 10:27:26,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-03-16 10:27:26,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-03-16 10:27:26,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-03-16 10:27:26,270 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-03-16 10:27:26,274 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-16 10:27:26,286 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-16 10:27:26,286 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-16 10:27:26,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 137 [2022-03-16 10:27:26,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:27:26 BasicIcfg [2022-03-16 10:27:26,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-16 10:27:26,288 INFO L158 Benchmark]: Toolchain (without parser) took 853534.03ms. Allocated memory was 181.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 132.0MB in the beginning and 577.6MB in the end (delta: -445.5MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-03-16 10:27:26,288 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 181.4MB. Free memory was 150.7MB in the beginning and 150.6MB in the end (delta: 76.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-16 10:27:26,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.21ms. Allocated memory is still 181.4MB. Free memory was 131.9MB in the beginning and 141.8MB in the end (delta: -9.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-03-16 10:27:26,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.02ms. Allocated memory is still 181.4MB. Free memory was 141.8MB in the beginning and 138.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-16 10:27:26,289 INFO L158 Benchmark]: Boogie Preprocessor took 32.53ms. Allocated memory is still 181.4MB. Free memory was 138.9MB in the beginning and 137.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-16 10:27:26,289 INFO L158 Benchmark]: RCFGBuilder took 451.28ms. Allocated memory is still 181.4MB. Free memory was 137.1MB in the beginning and 121.6MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-16 10:27:26,290 INFO L158 Benchmark]: TraceAbstraction took 852455.85ms. Allocated memory was 181.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 121.1MB in the beginning and 577.6MB in the end (delta: -456.5MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-03-16 10:27:26,291 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.36ms. Allocated memory is still 181.4MB. Free memory was 150.7MB in the beginning and 150.6MB in the end (delta: 76.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 534.21ms. Allocated memory is still 181.4MB. Free memory was 131.9MB in the beginning and 141.8MB in the end (delta: -9.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.02ms. Allocated memory is still 181.4MB. Free memory was 141.8MB in the beginning and 138.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.53ms. Allocated memory is still 181.4MB. Free memory was 138.9MB in the beginning and 137.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 451.28ms. Allocated memory is still 181.4MB. Free memory was 137.1MB in the beginning and 121.6MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 852455.85ms. Allocated memory was 181.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 121.1MB in the beginning and 577.6MB in the end (delta: -456.5MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks [2022-03-16 10:27:26,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - 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: 940]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 940]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 937]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 158 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 852.3s, OverallIterations: 23, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 442.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 341.3s InterpolantComputationTime, 7755 NumberOfCodeBlocks, 7096 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 9567 ConstructedInterpolants, 123 QuantifiedInterpolants, 62576 SizeOfPredicates, 74 NumberOfNonLiveVariables, 4974 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 44 InterpolantComputations, 14 PerfectInterpolantSequences, 27977/29820 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