/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 19:49:55,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 19:49:55,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 19:49:55,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 19:49:55,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 19:49:55,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 19:49:55,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 19:49:55,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 19:49:55,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 19:49:55,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 19:49:55,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 19:49:55,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 19:49:55,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 19:49:55,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 19:49:55,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 19:49:55,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 19:49:55,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 19:49:55,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 19:49:55,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 19:49:55,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 19:49:55,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 19:49:55,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 19:49:55,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 19:49:55,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 19:49:55,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 19:49:55,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 19:49:55,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 19:49:55,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 19:49:55,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 19:49:55,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 19:49:55,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 19:49:55,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 19:49:55,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 19:49:55,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 19:49:55,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 19:49:55,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 19:49:55,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 19:49:55,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 19:49:55,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 19:49:55,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 19:49:55,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 19:49:55,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 19:49:55,801 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 19:49:55,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 19:49:55,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 19:49:55,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 19:49:55,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 19:49:55,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 19:49:55,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 19:49:55,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 19:49:55,803 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 19:49:55,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 19:49:55,803 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 19:49:55,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 19:49:55,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 19:49:55,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 19:49:55,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 19:49:55,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:49:55,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 19:49:55,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 19:49:55,807 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 19:49:55,807 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 19:49:56,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 19:49:56,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 19:49:56,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 19:49:56,078 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 19:49:56,079 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 19:49:56,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-05-04 19:49:56,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04fe82dec/74670a0883f14c40ba0c119920d01a86/FLAG055535404 [2023-05-04 19:49:56,668 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 19:49:56,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-05-04 19:49:56,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04fe82dec/74670a0883f14c40ba0c119920d01a86/FLAG055535404 [2023-05-04 19:49:57,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04fe82dec/74670a0883f14c40ba0c119920d01a86 [2023-05-04 19:49:57,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 19:49:57,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 19:49:57,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 19:49:57,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 19:49:57,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 19:49:57,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7bade3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57, skipping insertion in model container [2023-05-04 19:49:57,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 19:49:57,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 19:49:57,212 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 19:49:57,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2023-05-04 19:49:57,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2023-05-04 19:49:57,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2023-05-04 19:49:57,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2023-05-04 19:49:57,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2023-05-04 19:49:57,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2023-05-04 19:49:57,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2023-05-04 19:49:57,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:49:57,659 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 19:49:57,703 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 19:49:57,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2023-05-04 19:49:57,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2023-05-04 19:49:57,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2023-05-04 19:49:57,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2023-05-04 19:49:57,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2023-05-04 19:49:57,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2023-05-04 19:49:57,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2023-05-04 19:49:57,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:49:57,853 INFO L208 MainTranslator]: Completed translation [2023-05-04 19:49:57,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57 WrapperNode [2023-05-04 19:49:57,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 19:49:57,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 19:49:57,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 19:49:57,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 19:49:57,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,947 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2023-05-04 19:49:57,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 19:49:57,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 19:49:57,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 19:49:57,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 19:49:57,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:57,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:58,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:58,004 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:58,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:58,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 19:49:58,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 19:49:58,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 19:49:58,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 19:49:58,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (1/1) ... [2023-05-04 19:49:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:49:58,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:49:58,059 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) [2023-05-04 19:49:58,061 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 [2023-05-04 19:49:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2023-05-04 19:49:58,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2023-05-04 19:49:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2023-05-04 19:49:58,095 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 19:49:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 19:49:58,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 19:49:58,097 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 19:49:58,212 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 19:49:58,214 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 19:49:58,478 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 19:49:58,485 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 19:49:58,485 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-05-04 19:49:58,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:49:58 BoogieIcfgContainer [2023-05-04 19:49:58,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 19:49:58,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 19:49:58,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 19:49:58,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 19:49:58,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 07:49:57" (1/3) ... [2023-05-04 19:49:58,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dba89bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:49:58, skipping insertion in model container [2023-05-04 19:49:58,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:49:57" (2/3) ... [2023-05-04 19:49:58,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dba89bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:49:58, skipping insertion in model container [2023-05-04 19:49:58,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:49:58" (3/3) ... [2023-05-04 19:49:58,494 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2023-05-04 19:49:58,501 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 19:49:58,507 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 19:49:58,507 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-05-04 19:49:58,507 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 19:49:58,612 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 19:49:58,650 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:49:58,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:49:58,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:49:58,651 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) [2023-05-04 19:49:58,664 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 [2023-05-04 19:49:58,715 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:49:58,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 19:49:58,754 INFO L357 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, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3471ef35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:49:58,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 19:49:59,148 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 19:49:59,148 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-05-04 19:49:59,156 INFO L444 BasicCegarLoop]: Path program histogram: [] [2023-05-04 19:49:59,157 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (1/2) [2023-05-04 19:49:59,170 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:49:59,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:49:59,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:49:59,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 19:49:59,177 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:49:59,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoThread1of1ForFork1 ======== [2023-05-04 19:49:59,178 INFO L357 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, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3471ef35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:49:59,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 19:49:59,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 19:49:59,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:49:59,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1250487988, now seen corresponding path program 1 times [2023-05-04 19:49:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:59,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109899475] [2023-05-04 19:49:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:49:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:49:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:49:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109899475] [2023-05-04 19:49:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109899475] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:49:59,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:49:59,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 19:49:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757414235] [2023-05-04 19:49:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:49:59,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 19:49:59,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:49:59,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 19:49:59,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 19:49:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:59,493 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:49:59,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:49:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 19:49:59,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:49:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089526, now seen corresponding path program 1 times [2023-05-04 19:49:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:59,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107450637] [2023-05-04 19:49:59,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:49:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:49:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:49:59,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107450637] [2023-05-04 19:49:59,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107450637] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:49:59,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:49:59,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 19:49:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052672611] [2023-05-04 19:49:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:49:59,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 19:49:59,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:49:59,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 19:49:59,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 19:49:59,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:59,639 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:49:59,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:49:59,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:59,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:49:59,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 19:49:59,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:49:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:59,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2128330288, now seen corresponding path program 1 times [2023-05-04 19:49:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:59,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077076394] [2023-05-04 19:49:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:00,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:00,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077076394] [2023-05-04 19:50:00,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077076394] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:00,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:00,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-05-04 19:50:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899104512] [2023-05-04 19:50:00,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:00,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-05-04 19:50:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:00,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-05-04 19:50:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2023-05-04 19:50:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:00,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:00,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:00,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:00,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:00,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:02,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 19:50:02,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash 710523851, now seen corresponding path program 1 times [2023-05-04 19:50:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:02,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990124073] [2023-05-04 19:50:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990124073] [2023-05-04 19:50:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990124073] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:02,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:02,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 19:50:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086300634] [2023-05-04 19:50:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:02,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 19:50:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 19:50:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 19:50:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:02,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:02,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:02,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:02,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:02,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:02,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:02,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 19:50:02,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1664455103, now seen corresponding path program 1 times [2023-05-04 19:50:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:02,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666480449] [2023-05-04 19:50:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666480449] [2023-05-04 19:50:03,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666480449] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:03,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:03,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 19:50:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805657083] [2023-05-04 19:50:03,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:03,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 19:50:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:03,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 19:50:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2023-05-04 19:50:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:03,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:03,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.275862068965517) internal successors, (124), 29 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:03,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:03,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:03,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:03,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:03,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:06,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 19:50:06,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2002501496, now seen corresponding path program 1 times [2023-05-04 19:50:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741214952] [2023-05-04 19:50:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:08,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:08,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741214952] [2023-05-04 19:50:08,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741214952] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:08,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:08,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2023-05-04 19:50:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387653061] [2023-05-04 19:50:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:08,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-05-04 19:50:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-05-04 19:50:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2023-05-04 19:50:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:08,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:08,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 35 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:08,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:08,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:08,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:08,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:08,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:08,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:12,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 19:50:12,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1948005859, now seen corresponding path program 1 times [2023-05-04 19:50:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:12,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360359622] [2023-05-04 19:50:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:12,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:14,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360359622] [2023-05-04 19:50:14,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360359622] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:14,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:14,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2023-05-04 19:50:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130529108] [2023-05-04 19:50:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:14,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-05-04 19:50:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:14,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-05-04 19:50:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2023-05-04 19:50:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:14,250 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:14,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 36 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:14,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:14,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:14,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:14,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:14,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:14,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:14,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:18,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 19:50:18,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1758245091, now seen corresponding path program 1 times [2023-05-04 19:50:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:18,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467084273] [2023-05-04 19:50:18,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:18,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:18,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467084273] [2023-05-04 19:50:18,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467084273] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:18,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:18,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 19:50:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221545860] [2023-05-04 19:50:18,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:18,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 19:50:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 19:50:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-05-04 19:50:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:18,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:18,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:18,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:18,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:18,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:18,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:18,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:18,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:18,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:18,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:18,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 19:50:18,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:18,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash 499896379, now seen corresponding path program 1 times [2023-05-04 19:50:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:18,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336260064] [2023-05-04 19:50:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:19,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:19,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336260064] [2023-05-04 19:50:19,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336260064] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:19,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:19,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-05-04 19:50:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878352183] [2023-05-04 19:50:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:19,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-05-04 19:50:19,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-05-04 19:50:19,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2023-05-04 19:50:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:19,617 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:19,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.818181818181818) internal successors, (150), 22 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:19,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 19:50:20,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 19:50:20,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1763014326, now seen corresponding path program 1 times [2023-05-04 19:50:20,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:20,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790035807] [2023-05-04 19:50:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790035807] [2023-05-04 19:50:23,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790035807] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:50:23,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:50:23,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2023-05-04 19:50:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554614346] [2023-05-04 19:50:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:50:23,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-05-04 19:50:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-05-04 19:50:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1957, Unknown=0, NotChecked=0, Total=2070 [2023-05-04 19:50:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:23,666 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:23,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.3260869565217392) internal successors, (153), 46 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:23,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:23,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:23,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:23,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:23,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:23,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:23,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:23,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:23,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 19:50:23,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 19:50:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-05-04 19:50:29,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 19:50:29,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash -11627134, now seen corresponding path program 1 times [2023-05-04 19:50:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:29,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408165821] [2023-05-04 19:50:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 19:50:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:30,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408165821] [2023-05-04 19:50:30,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408165821] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:50:30,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132758641] [2023-05-04 19:50:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:30,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:50:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:50:30,068 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) [2023-05-04 19:50:30,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 19:50:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:30,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjunts are in the unsatisfiable core [2023-05-04 19:50:30,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:50:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 19:50:30,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:50:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 19:50:30,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132758641] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:50:30,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:50:30,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-05-04 19:50:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170555719] [2023-05-04 19:50:30,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:50:30,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 19:50:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:30,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 19:50:30,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-05-04 19:50:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:30,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:30,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.714285714285715) internal successors, (404), 7 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-05-04 19:50:30,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-05-04 19:50:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:30,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-05-04 19:50:30,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:50:30,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 13447780, now seen corresponding path program 1 times [2023-05-04 19:50:30,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:30,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710253985] [2023-05-04 19:50:30,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:30,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:30,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710253985] [2023-05-04 19:50:30,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710253985] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:50:30,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583660428] [2023-05-04 19:50:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:30,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:50:30,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:50:30,949 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) [2023-05-04 19:50:30,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 19:50:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:31,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjunts are in the unsatisfiable core [2023-05-04 19:50:31,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:50:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:31,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:50:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:31,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583660428] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:50:31,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:50:31,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-05-04 19:50:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441015812] [2023-05-04 19:50:31,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:50:31,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 19:50:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:50:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 19:50:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-05-04 19:50:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:31,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:50:31,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:31,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 19:50:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-05-04 19:50:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:50:31,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 19:50:31,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:50:31,651 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 19:50:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:50:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1962928643, now seen corresponding path program 1 times [2023-05-04 19:50:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:50:31,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458810336] [2023-05-04 19:50:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:50:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:37,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:50:37,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458810336] [2023-05-04 19:50:37,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458810336] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:50:37,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312545545] [2023-05-04 19:50:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:50:37,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:50:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:50:37,150 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) [2023-05-04 19:50:37,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 19:50:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:50:37,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 160 conjunts are in the unsatisfiable core [2023-05-04 19:50:37,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:50:37,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 19:50:37,370 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-05-04 19:50:37,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 19:50:37,396 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-05-04 19:50:37,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 22 treesize of output 33 [2023-05-04 19:50:37,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 [2023-05-04 19:50:37,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:50:37,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-05-04 19:50:37,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-05-04 19:50:38,018 INFO L390 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 23 [2023-05-04 19:50:38,765 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-04 19:50:38,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 19:50:39,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:50:39,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:50:39,669 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-05-04 19:50:39,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2023-05-04 19:50:39,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:50:39,886 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:50:39,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 69 [2023-05-04 19:50:40,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-05-04 19:50:40,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-05-04 19:50:41,315 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:50:41,328 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-05-04 19:50:41,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2023-05-04 19:50:41,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:50:41,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:50:41,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-05-04 19:50:41,884 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2023-05-04 19:50:41,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2023-05-04 19:50:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:50:42,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:50:44,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (let ((.cse3 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20))) (store (let ((.cse2 (select .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse2 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse2 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509)))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)))) is different from false [2023-05-04 19:50:44,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| 1))) (let ((.cse7 (mod .cse12 4))) (let ((.cse1 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse5 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse6 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|)) (.cse8 (< .cse12 0)) (.cse0 (= .cse7 0))) (and (or .cse0 (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse1) (< 0 (let ((.cse2 (select (let ((.cse3 (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store .cse6 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (- 4) .cse7))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse4 (select .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse4 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse4 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse2 (+ (* (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))) (not .cse8)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse1) (< 0 (let ((.cse9 (select (let ((.cse10 (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store .cse6 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| .cse7)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse11 (select .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse11 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse11 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse9 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))))) (and .cse8 (not .cse0))))))) is different from false [2023-05-04 19:50:44,447 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|))) (let ((.cse12 (+ (select .cse6 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 1))) (let ((.cse7 (mod .cse12 4))) (let ((.cse1 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse5 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse8 (= .cse7 0)) (.cse0 (< .cse12 0))) (and (or (not .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse1) (< 0 (let ((.cse2 (select (let ((.cse3 (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store .cse6 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (- 4) .cse7))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse4 (select .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse4 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse4 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse2 (+ (* (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))) .cse8) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse1) (< 0 (let ((.cse9 (select (let ((.cse10 (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store .cse6 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| .cse7)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse11 (select .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse11 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse11 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse9 (+ (* (select .cse9 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))) (and (not .cse8) .cse0))))))) is different from false [2023-05-04 19:50:44,669 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base|))) (let ((.cse12 (+ (select .cse4 |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset|) 1))) (let ((.cse5 (mod .cse12 4))) (let ((.cse8 (= .cse5 0)) (.cse7 (< .cse12 0)) (.cse6 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse3 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20))) (and (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| (store .cse4 |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| (+ (- 4) .cse5))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse2 (select .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse2 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select .cse2 .cse3) 4)) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 .cse6))) (not .cse7) .cse8) (or (and (not .cse8) .cse7) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse6) (< 0 (let ((.cse9 (select (let ((.cse10 (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| (store .cse4 |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| .cse5)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse11 (select .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse11 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select .cse11 .cse3) 4)) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse9 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))))))))))) is different from false [2023-05-04 19:51:02,743 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse0 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse10 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse12 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (and (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse1 (+ (select .cse9 .cse10) 1))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse9 .cse10 (mod .cse1 4))))) (let ((.cse7 (select .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse8 (+ (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< .cse1 0) (< 0 (let ((.cse2 (select (let ((.cse3 (store (store .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse8 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse4 (select .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse4 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse4 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse2 (+ (* (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse8 0)))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse20 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse13 (mod (+ (select .cse20 .cse10) 1) 4))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse20 .cse10 .cse13)))) (let ((.cse18 (select .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse19 (+ (select .cse18 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (not (= .cse13 0)) (< 0 (let ((.cse14 (select (let ((.cse15 (store (store .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse18 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse19 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse15 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse16 (select .cse15 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse16 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse16 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse14 (+ (* (select .cse14 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse19 0)))))))))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse28 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse21 (+ (select .cse28 .cse10) 1))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse28 .cse10 (mod .cse21 4))))) (let ((.cse26 (select .cse25 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse27 (mod (+ (select .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< .cse21 0) (< 0 (let ((.cse22 (select (let ((.cse23 (store (store .cse25 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse27)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse23 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse24 (select .cse23 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse24 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse24 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse22 (+ (* (select .cse22 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (= .cse27 0))))))))) (< v_ArrVal_507 .cse0))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse37 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse30 (+ (select .cse37 .cse10) 1))) (let ((.cse29 (mod .cse30 4))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse37 .cse10 (+ (- 4) .cse29))))) (let ((.cse35 (select .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse36 (+ (select .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (= .cse29 0) (not (< .cse30 0)) (< 0 (let ((.cse31 (select (let ((.cse32 (store (store .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse36 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse32 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse33 (select .cse32 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse33 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse33 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse31 (+ (* (select .cse31 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse36 0))))))))))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse45 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse38 (mod (+ (select .cse45 .cse10) 1) 4))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse45 .cse10 .cse38)))) (let ((.cse43 (select .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse44 (mod (+ (select .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (not (= .cse38 0)) (< 0 (let ((.cse39 (select (let ((.cse40 (store (store .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse44)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse40 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse41 (select .cse40 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse41 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse41 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse39 (+ (* (select .cse39 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (= .cse44 0))))))))) (< v_ArrVal_507 .cse0))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse54 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse48 (+ (select .cse54 .cse10) 1))) (let ((.cse46 (mod .cse48 4))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse54 .cse10 (+ (- 4) .cse46))))) (let ((.cse53 (select .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse47 (mod (+ (select .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (= .cse46 0) (not (= .cse47 0)) (not (< .cse48 0)) (< 0 (let ((.cse49 (select (let ((.cse50 (store (store .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse47)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse50 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse51 (select .cse50 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse51 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse51 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse49 (+ (* (select .cse49 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))))))))) (< v_ArrVal_507 .cse0))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse63 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse55 (mod (+ (select .cse63 .cse10) 1) 4))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse63 .cse10 .cse55)))) (let ((.cse62 (select .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse56 (+ (select .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse57 (mod .cse56 4))) (or (not (= .cse55 0)) (not (< .cse56 0)) (= .cse57 0) (< 0 (let ((.cse58 (select (let ((.cse59 (store (store .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ .cse57 (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse59 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse60 (select .cse59 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse60 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse60 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse58 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse58 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse72 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse64 (+ (select .cse72 .cse10) 1))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse72 .cse10 (mod .cse64 4))))) (let ((.cse71 (select .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse65 (+ (select .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse66 (mod .cse65 4))) (or (< .cse64 0) (not (< .cse65 0)) (= .cse66 0) (< 0 (let ((.cse67 (select (let ((.cse68 (store (store .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ .cse66 (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse68 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse69 (select .cse68 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse69 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse69 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse67 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse67 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))))))))))))) (forall ((v_ArrVal_501 Int)) (let ((.cse82 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse75 (+ (select .cse82 .cse10) 1))) (let ((.cse73 (mod .cse75 4))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse82 .cse10 (+ (- 4) .cse73))))) (let ((.cse81 (select .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse76 (+ (select .cse81 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse74 (mod .cse76 4))) (or (= .cse73 0) (= .cse74 0) (not (< .cse75 0)) (not (< .cse76 0)) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< 0 (let ((.cse77 (select (let ((.cse78 (store (store .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse81 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse74))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse78 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse79 (select .cse78 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse79 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse79 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse77 (+ (* 4 (select .cse77 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 .cse0)))))))))))))) is different from false [2023-05-04 19:51:05,072 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse9 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse12 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse3 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse11 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse10 .cse9) 4)))) (and (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse8 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse7 (+ (select .cse8 .cse9) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse8 .cse9 (mod .cse7 4))))) (let ((.cse5 (select .cse4 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse6 (+ (select .cse5 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store (store .cse4 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse5 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse6 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse2 (select .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse2 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse2 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse0 (+ (* 4 (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse7 0) (< .cse6 0)))))))) (< v_ArrVal_507 .cse12))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse20 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse19 (mod (+ (select .cse20 .cse9) 1) 4))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse20 .cse9 .cse19)))) (let ((.cse17 (select .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse18 (+ (select .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< 0 (let ((.cse13 (select (let ((.cse14 (store (store .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse18 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse14 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse15 (select .cse14 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse15 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse15 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse13 (+ (* 4 (select .cse13 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (= .cse19 0)) (< .cse18 0)))))))) (< v_ArrVal_507 .cse12))) (forall ((v_ArrVal_501 Int)) (let ((.cse30 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse21 (+ (select .cse30 .cse9) 1))) (let ((.cse23 (mod .cse21 4))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse30 .cse9 (+ (- 4) .cse23))))) (let ((.cse29 (select .cse28 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse24 (+ (select .cse29 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse22 (mod .cse24 4))) (or (not (< .cse21 0)) (= .cse22 0) (= .cse23 0) (not (< .cse24 0)) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< 0 (let ((.cse25 (select (let ((.cse26 (store (store .cse28 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse29 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse22))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse26 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse27 (select .cse26 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse27 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse27 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse25 (+ (* (select .cse25 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 .cse12)))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse12) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse38 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse37 (+ (select .cse38 .cse9) 1))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse38 .cse9 (mod .cse37 4))))) (let ((.cse35 (select .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse36 (mod (+ (select .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< 0 (let ((.cse31 (select (let ((.cse32 (store (store .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse36)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse32 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse33 (select .cse32 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse33 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse33 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse31 (+ (* 4 (select .cse31 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse37 0) (not (= .cse36 0))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse12) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse47 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse46 (mod (+ (select .cse47 .cse9) 1) 4))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse47 .cse9 .cse46)))) (let ((.cse43 (select .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse45 (+ (select .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse44 (mod .cse45 4))) (or (< 0 (let ((.cse39 (select (let ((.cse40 (store (store .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ .cse44 (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse40 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse41 (select .cse40 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse41 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse41 .cse3))) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse39 (+ (* (select .cse39 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (< .cse45 0)) (= .cse44 0) (not (= .cse46 0)))))))))))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse56 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse48 (+ (select .cse56 .cse9) 1))) (let ((.cse49 (mod .cse48 4))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse56 .cse9 (+ (- 4) .cse49))))) (let ((.cse54 (select .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse55 (+ (select .cse54 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (not (< .cse48 0)) (= .cse49 0) (< 0 (let ((.cse50 (select (let ((.cse51 (store (store .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse54 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse55 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse51 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse52 (select .cse51 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse52 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select .cse52 .cse3) 4)) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse50 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* 4 (select .cse50 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4)))) (< .cse55 0))))))))) (< v_ArrVal_507 .cse12))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse12) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse64 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse63 (mod (+ (select .cse64 .cse9) 1) 4))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse64 .cse9 .cse63)))) (let ((.cse61 (select .cse60 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse62 (mod (+ (select .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< 0 (let ((.cse57 (select (let ((.cse58 (store (store .cse60 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse62)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse58 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse59 (select .cse58 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse59 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse59 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse57 (+ (* 4 (select .cse57 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (= .cse63 0)) (not (= .cse62 0))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse12) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse73 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse65 (+ (select .cse73 .cse9) 1))) (let ((.cse67 (mod .cse65 4))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse73 .cse9 (+ (- 4) .cse67))))) (let ((.cse72 (select .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse66 (mod (+ (select .cse72 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (not (< .cse65 0)) (not (= .cse66 0)) (= .cse67 0) (< 0 (let ((.cse68 (select (let ((.cse69 (store (store .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse72 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse66)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse69 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse70 (select .cse69 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse70 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select .cse70 .cse3) 4)) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse68 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* 4 (select .cse68 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4)))))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse12) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse82 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse74 (+ (select .cse82 .cse9) 1))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse82 .cse9 (mod .cse74 4))))) (let ((.cse79 (select .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse81 (+ (select .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse80 (mod .cse81 4))) (or (< .cse74 0) (< 0 (let ((.cse75 (select (let ((.cse76 (store (store .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ .cse80 (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse76 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse77 (select .cse76 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse77 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse77 .cse3))) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse75 (+ (* (select .cse75 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (< .cse81 0)) (= .cse80 0)))))))))))))) is different from false [2023-05-04 19:51:10,878 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse10 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (let ((.cse0 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse5 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse12 (+ (* 4 (select .cse11 .cse10)) 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (and (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse1 (+ (select .cse9 .cse10) 1))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse9 .cse10 (mod .cse1 4))))) (let ((.cse7 (select .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse8 (+ 1 (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (< .cse1 0) (< 0 (let ((.cse2 (select (let ((.cse3 (store (store .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse8 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse4 (select .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse4 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse4 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse2 (+ (* 4 (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse8 0)))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse21 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse20 (+ (select .cse21 .cse10) 1))) (let ((.cse19 (mod .cse20 4))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse21 .cse10 (+ (- 4) .cse19))))) (let ((.cse17 (select .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse18 (+ (select .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< 0 (let ((.cse13 (select (let ((.cse14 (store (store .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse18 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse14 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse15 (select .cse14 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse15 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse15 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse13 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse13 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (= 0 .cse19) (< .cse18 0) (not (< .cse20 0)))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse30 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse29 (+ (select .cse30 .cse10) 1))) (let ((.cse28 (mod .cse29 4))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse30 .cse10 (+ (- 4) .cse28))))) (let ((.cse26 (select .cse25 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse27 (mod (+ (select .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< 0 (let ((.cse22 (select (let ((.cse23 (store (store .cse25 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse27)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse23 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse24 (select .cse23 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse24 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse24 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse22 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse22 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (= 0 .cse28) (not (= .cse27 0)) (not (< .cse29 0)))))))))))) (forall ((v_ArrVal_501 Int)) (let ((.cse40 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse39 (+ (select .cse40 .cse10) 1))) (let ((.cse38 (mod .cse39 4))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse40 .cse10 (+ (- 4) .cse38))))) (let ((.cse35 (select .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse37 (+ (select .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse36 (mod .cse37 4))) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (< 0 (let ((.cse31 (select (let ((.cse32 (store (store .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ .cse36 (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse32 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse33 (select .cse32 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse33 (+ (* (select .cse33 .cse5) 4) |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse31 (+ (* (select .cse31 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))) (= .cse36 0) (not (< .cse37 0)) (= 0 .cse38) (not (< .cse39 0))))))))))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse49 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse43 (mod (+ (select .cse49 .cse10) 1) 4))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse49 .cse10 .cse43)))) (let ((.cse48 (select .cse47 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse41 (+ 1 (select .cse48 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (let ((.cse42 (mod .cse41 4))) (or (not (< .cse41 0)) (= .cse42 0) (not (= 0 .cse43)) (< 0 (let ((.cse44 (select (let ((.cse45 (store (store .cse47 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse48 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ .cse42 (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse45 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse46 (select .cse45 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse46 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse46 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse44 (+ (* (select .cse44 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))))))))) (< v_ArrVal_507 .cse0))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse58 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse52 (+ (select .cse58 .cse10) 1))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse58 .cse10 (mod .cse52 4))))) (let ((.cse57 (select .cse56 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse50 (+ 1 (select .cse57 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (let ((.cse51 (mod .cse50 4))) (or (not (< .cse50 0)) (= .cse51 0) (< .cse52 0) (< 0 (let ((.cse53 (select (let ((.cse54 (store (store .cse56 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse57 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ .cse51 (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse54 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse55 (select .cse54 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse55 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse55 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse53 (+ (* (select .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))))))))))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse66 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse59 (+ (select .cse66 .cse10) 1))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse66 .cse10 (mod .cse59 4))))) (let ((.cse65 (select .cse64 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse60 (mod (+ 1 (select .cse65 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4))) (or (< .cse59 0) (not (= .cse60 0)) (< 0 (let ((.cse61 (select (let ((.cse62 (store (store .cse64 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse65 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse60)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse62 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse63 (select .cse62 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse63 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse63 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse61 (+ (* 4 (select .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))))))))))) (< v_ArrVal_507 .cse0))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse74 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse67 (mod (+ (select .cse74 .cse10) 1) 4))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse74 .cse10 .cse67)))) (let ((.cse72 (select .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse73 (+ 1 (select .cse72 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (not (= 0 .cse67)) (< 0 (let ((.cse68 (select (let ((.cse69 (store (store .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse72 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse73 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse69 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse70 (select .cse69 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse70 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse70 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse68 (+ (* 4 (select .cse68 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse73 0)))))))) (< v_ArrVal_507 .cse0))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse82 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse76 (mod (+ (select .cse82 .cse10) 1) 4))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse82 .cse10 .cse76)))) (let ((.cse81 (select .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse75 (mod (+ 1 (select .cse81 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4))) (or (not (= .cse75 0)) (not (= 0 .cse76)) (< 0 (let ((.cse77 (select (let ((.cse78 (store (store .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse81 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse75)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse78 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse79 (select .cse78 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse79 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse79 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse77 (+ (* 4 (select .cse77 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))))))))))))) is different from false [2023-05-04 19:51:13,597 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse0 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse5 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse11 .cse10) 4) 4))) (and (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse1 (+ (select .cse9 .cse10) 1))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse9 .cse10 (mod .cse1 4))))) (let ((.cse7 (select .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse8 (+ (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< .cse1 0) (< 0 (let ((.cse2 (select (let ((.cse3 (store (store .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse8 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse4 (select .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse4 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse4 .cse5))) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse2 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse2 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (< .cse8 0)))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse21 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse19 (mod (+ (select .cse21 .cse10) 1) 4))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse21 .cse10 .cse19)))) (let ((.cse17 (select .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse20 (+ (select .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse18 (mod .cse20 4))) (or (< 0 (let ((.cse13 (select (let ((.cse14 (store (store .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse18))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse14 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse15 (select .cse14 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse15 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse15 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse13 (+ (* (select .cse13 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (= .cse18 0) (not (= .cse19 0)) (not (< .cse20 0)))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse30 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse29 (+ (select .cse30 .cse10) 1))) (let ((.cse22 (mod .cse29 4))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse30 .cse10 (+ .cse22 (- 4)))))) (let ((.cse27 (select .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse28 (mod (+ 1 (select .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4))) (or (= .cse22 0) (< 0 (let ((.cse23 (select (let ((.cse24 (store (store .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse28)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse24 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse25 (select .cse24 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse25 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* 4 (select .cse25 .cse5)) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse23 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse23 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))) (not (< .cse29 0)) (not (= .cse28 0)))))))))))) (forall ((v_ArrVal_501 Int)) (let ((.cse40 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse32 (+ (select .cse40 .cse10) 1))) (let ((.cse31 (mod .cse32 4))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse40 .cse10 (+ .cse31 (- 4)))))) (let ((.cse39 (select .cse38 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse33 (+ 1 (select .cse39 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (let ((.cse34 (mod .cse33 4))) (or (= .cse31 0) (not (< .cse32 0)) (not (< .cse33 0)) (= .cse34 0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (< 0 (let ((.cse35 (select (let ((.cse36 (store (store .cse38 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse39 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse34))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse36 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse37 (select .cse36 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse37 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select .cse37 .cse5) 4)) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse35 (+ (* (select .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))))))))))))))) (forall ((v_ArrVal_507 Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse48 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse41 (+ (select .cse48 .cse10) 1))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse48 .cse10 (mod .cse41 4))))) (let ((.cse46 (select .cse45 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse47 (mod (+ (select .cse46 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< .cse41 0) (< 0 (let ((.cse42 (select (let ((.cse43 (store (store .cse45 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse46 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse47)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse43 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse44 (select .cse43 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse44 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse44 .cse5))) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse42 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (not (= .cse47 0))))))))) (< v_ArrVal_507 .cse0))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse56 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse55 (mod (+ (select .cse56 .cse10) 1) 4))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse56 .cse10 .cse55)))) (let ((.cse53 (select .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse54 (mod (+ (select .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< 0 (let ((.cse49 (select (let ((.cse50 (store (store .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse54)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse50 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse51 (select .cse50 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse51 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse51 .cse5))) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse49 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse49 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (not (= .cse55 0)) (not (= .cse54 0))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse65 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse63 (+ (select .cse65 .cse10) 1))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse65 .cse10 (mod .cse63 4))))) (let ((.cse61 (select .cse60 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse64 (+ (select .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse62 (mod .cse64 4))) (or (< 0 (let ((.cse57 (select (let ((.cse58 (store (store .cse60 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse62))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse58 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse59 (select .cse58 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse59 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse59 .cse5) 4) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse57 (+ (* (select .cse57 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse63 0) (= .cse62 0) (not (< .cse64 0)))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse74 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse73 (+ (select .cse74 .cse10) 1))) (let ((.cse66 (mod .cse73 4))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse74 .cse10 (+ .cse66 (- 4)))))) (let ((.cse71 (select .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse72 (+ 1 (select .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (= .cse66 0) (< 0 (let ((.cse67 (select (let ((.cse68 (store (store .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse72 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse68 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse69 (select .cse68 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse69 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* 4 (select .cse69 .cse5)) 4) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse67 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse67 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))) (not (< .cse73 0)) (< .cse72 0))))))))))) (forall ((v_ArrVal_507 Int)) (or (< v_ArrVal_507 .cse0) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_501 Int)) (let ((.cse82 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse81 (mod (+ (select .cse82 .cse10) 1) 4))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse82 .cse10 .cse81)))) (let ((.cse79 (select .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse80 (+ (select .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< 0 (let ((.cse75 (select (let ((.cse76 (store (store .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse80 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse76 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse77 (select .cse76 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse77 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse77 .cse5))) v_ArrVal_507)) .cse5 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse75 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse75 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (not (= .cse81 0)) (< .cse80 0))))))))))))) is different from false [2023-05-04 19:51:17,791 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse9 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse3 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse11 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse10 .cse9) 4) 4))) (and (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse8 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse7 (mod (+ (select .cse8 .cse9) 1) 4))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse8 .cse9 .cse7)))) (let ((.cse5 (select .cse4 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse6 (+ (select .cse5 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store (store .cse4 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse5 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse6 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse2 (select .cse1 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse2 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse2 .cse3))) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (not (= .cse7 0)) (< v_ArrVal_507 1) (< .cse6 0)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse19 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse18 (mod (+ (select .cse19 .cse9) 1) 4))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse19 .cse9 .cse18)))) (let ((.cse16 (select .cse15 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse17 (mod (+ (select .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< 0 (let ((.cse12 (select (let ((.cse13 (store (store .cse15 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse17)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse13 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse14 (select .cse13 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse14 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse14 .cse3))) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse12 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse12 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (not (= .cse18 0)) (not (= .cse17 0)) (< v_ArrVal_507 1)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse28 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse26 (+ (select .cse28 .cse9) 1))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse28 .cse9 (mod .cse26 4))))) (let ((.cse24 (select .cse23 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse27 (+ (select .cse24 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse25 (mod .cse27 4))) (or (< 0 (let ((.cse20 (select (let ((.cse21 (store (store .cse23 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse24 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse25))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse21 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse22 (select .cse21 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse22 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse22 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse20 (+ (* (select .cse20 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse26 0) (= .cse25 0) (< v_ArrVal_507 1) (not (< .cse27 0)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse37 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse35 (mod (+ (select .cse37 .cse9) 1) 4))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse37 .cse9 .cse35)))) (let ((.cse33 (select .cse32 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse36 (+ (select .cse33 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse34 (mod .cse36 4))) (or (< 0 (let ((.cse29 (select (let ((.cse30 (store (store .cse32 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse33 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse34))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse30 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse31 (select .cse30 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse31 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse31 .cse3) 4) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse29 (+ (* (select .cse29 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (= .cse34 0) (not (= .cse35 0)) (< v_ArrVal_507 1) (not (< .cse36 0)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse46 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse45 (+ (select .cse46 .cse9) 1))) (let ((.cse38 (mod .cse45 4))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse46 .cse9 (+ .cse38 (- 4)))))) (let ((.cse43 (select .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse44 (+ 1 (select .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (= .cse38 0) (< 0 (let ((.cse39 (select (let ((.cse40 (store (store .cse42 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse44 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse40 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse41 (select .cse40 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse41 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* 4 (select .cse41 .cse3)) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse39 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse39 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))) (not (< .cse45 0)) (< .cse44 0) (< v_ArrVal_507 1))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse56 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse48 (+ (select .cse56 .cse9) 1))) (let ((.cse47 (mod .cse48 4))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse56 .cse9 (+ .cse47 (- 4)))))) (let ((.cse55 (select .cse54 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse49 (+ 1 (select .cse55 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (let ((.cse50 (mod .cse49 4))) (or (= .cse47 0) (not (< .cse48 0)) (not (< .cse49 0)) (= .cse50 0) (< 0 (let ((.cse51 (select (let ((.cse52 (store (store .cse54 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse55 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse50))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse52 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse53 (select .cse52 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse53 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select .cse53 .cse3) 4)) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse51 (+ (* (select .cse51 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 1)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse64 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse57 (+ (select .cse64 .cse9) 1))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse64 .cse9 (mod .cse57 4))))) (let ((.cse62 (select .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse63 (mod (+ (select .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< .cse57 0) (< 0 (let ((.cse58 (select (let ((.cse59 (store (store .cse61 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse63)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse59 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse60 (select .cse59 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse60 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse60 .cse3))) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse58 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse58 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (not (= .cse63 0)) (< v_ArrVal_507 1)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse73 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse72 (+ (select .cse73 .cse9) 1))) (let ((.cse65 (mod .cse72 4))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse73 .cse9 (+ .cse65 (- 4)))))) (let ((.cse70 (select .cse69 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse71 (mod (+ 1 (select .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4))) (or (= .cse65 0) (< 0 (let ((.cse66 (select (let ((.cse67 (store (store .cse69 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse71)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse67 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse68 (select .cse67 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse68 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* 4 (select .cse68 .cse3)) 4) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse66 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse66 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))) (not (< .cse72 0)) (< v_ArrVal_507 1) (not (= .cse71 0)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse81 (store .cse10 .cse11 v_ArrVal_501))) (let ((.cse74 (+ (select .cse81 .cse9) 1))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse81 .cse9 (mod .cse74 4))))) (let ((.cse79 (select .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse80 (+ (select .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< .cse74 0) (< 0 (let ((.cse75 (select (let ((.cse76 (store (store .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse80 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse76 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (let ((.cse77 (select .cse76 |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (store .cse77 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* 4 (select .cse77 .cse3))) v_ArrVal_507)) .cse3 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse75 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (* (select .cse75 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) 4)))) (< v_ArrVal_507 1) (< .cse80 0))))))))))) is different from false [2023-05-04 19:51:20,288 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse6 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| 20)) (.cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse11 .cse10) 4) 4))) (and (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse1 (+ (select .cse9 .cse10) 1))) (let ((.cse0 (mod .cse1 4))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse9 .cse10 (+ .cse0 (- 4)))))) (let ((.cse8 (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse2 (+ 1 (select .cse8 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (= .cse0 0) (not (< .cse1 0)) (< .cse2 0) (< 0 (let ((.cse3 (select (let ((.cse4 (store (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse8 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse2 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse4 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse5 (select .cse4 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) |c_writer_fnThread1of1ForFork0_~arg#1.offset| 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse3 (+ (* (select .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 1))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse20 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse13 (+ (select .cse20 .cse10) 1))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse20 .cse10 (mod .cse13 4))))) (let ((.cse18 (select .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse19 (+ (select .cse18 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< .cse13 0) (< v_ArrVal_507 1) (< 0 (let ((.cse14 (select (let ((.cse15 (store (store .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse18 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse19 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse15 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse16 (select .cse15 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse16 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| (* (select .cse16 .cse6) 4) 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse14 (+ (* (select .cse14 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse19 0)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse29 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse22 (+ (select .cse29 .cse10) 1))) (let ((.cse21 (mod .cse22 4))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse29 .cse10 (+ .cse21 (- 4)))))) (let ((.cse27 (select .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse28 (mod (+ 1 (select .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4))) (or (= .cse21 0) (not (< .cse22 0)) (< 0 (let ((.cse23 (select (let ((.cse24 (store (store .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse28)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse24 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse25 (select .cse24 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse25 (+ (* (select .cse25 .cse6) 4) |c_writer_fnThread1of1ForFork0_~arg#1.offset| 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse23 (+ (* (select .cse23 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 1) (not (= .cse28 0)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse38 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse36 (mod (+ (select .cse38 .cse10) 1) 4))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse38 .cse10 .cse36)))) (let ((.cse35 (select .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse37 (+ (select .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse30 (mod .cse37 4))) (or (= .cse30 0) (< 0 (let ((.cse31 (select (let ((.cse32 (store (store .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse35 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse30))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse32 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse33 (select .cse32 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse33 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| (* (select .cse33 .cse6) 4) 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse31 (+ (* (select .cse31 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (= .cse36 0)) (< v_ArrVal_507 1) (not (< .cse37 0)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse46 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse39 (+ (select .cse46 .cse10) 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse46 .cse10 (mod .cse39 4))))) (let ((.cse45 (select .cse44 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse40 (mod (+ (select .cse45 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< .cse39 0) (not (= .cse40 0)) (< v_ArrVal_507 1) (< 0 (let ((.cse41 (select (let ((.cse42 (store (store .cse44 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse45 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse40)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse42 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse43 (select .cse42 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse43 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| (* (select .cse43 .cse6) 4) 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse41 (+ (* (select .cse41 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse54 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse47 (mod (+ (select .cse54 .cse10) 1) 4))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse54 .cse10 .cse47)))) (let ((.cse53 (select .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse48 (mod (+ (select .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (not (= .cse47 0)) (not (= .cse48 0)) (< v_ArrVal_507 1) (< 0 (let ((.cse49 (select (let ((.cse50 (store (store .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse53 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse48)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse50 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse51 (select .cse50 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse51 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| (* (select .cse51 .cse6) 4) 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse49 (+ (* (select .cse49 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse62 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse55 (mod (+ (select .cse62 .cse10) 1) 4))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse62 .cse10 .cse55)))) (let ((.cse60 (select .cse59 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse61 (+ (select .cse60 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (not (= .cse55 0)) (< v_ArrVal_507 1) (< 0 (let ((.cse56 (select (let ((.cse57 (store (store .cse59 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse60 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse61 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse57 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse58 (select .cse57 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse58 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| (* (select .cse58 .cse6) 4) 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse56 (+ (* (select .cse56 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse61 0)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse72 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse64 (+ (select .cse72 .cse10) 1))) (let ((.cse63 (mod .cse64 4))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse72 .cse10 (+ .cse63 (- 4)))))) (let ((.cse71 (select .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse65 (+ 1 (select .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (let ((.cse66 (mod .cse65 4))) (or (= .cse63 0) (not (< .cse64 0)) (not (< .cse65 0)) (= .cse66 0) (< 0 (let ((.cse67 (select (let ((.cse68 (store (store .cse70 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse71 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse66))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse68 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse69 (select .cse68 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse69 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| (* (select .cse69 .cse6) 4) 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse67 (+ (* (select .cse67 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 1)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse81 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse73 (+ (select .cse81 .cse10) 1))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse81 .cse10 (mod .cse73 4))))) (let ((.cse79 (select .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse80 (+ (select .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse74 (mod .cse80 4))) (or (< .cse73 0) (= .cse74 0) (< 0 (let ((.cse75 (select (let ((.cse76 (store (store .cse78 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse74))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse76 |c_writer_fnThread1of1ForFork0_~arg#1.base| (store (let ((.cse77 (select .cse76 |c_writer_fnThread1of1ForFork0_~arg#1.base|))) (store .cse77 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| (* (select .cse77 .cse6) 4) 4) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse75 (+ (* (select .cse75 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_507 1) (not (< .cse80 0))))))))))))) is different from false [2023-05-04 19:51:22,831 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse6 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse11 .cse10) 4) 4))) (and (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse1 (+ (select .cse9 .cse10) 1))) (let ((.cse0 (mod .cse1 4))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse9 .cse10 (+ .cse0 (- 4)))))) (let ((.cse8 (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse2 (mod (+ 1 (select .cse8 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) 4))) (or (= .cse0 0) (not (< .cse1 0)) (< v_ArrVal_507 1) (not (= .cse2 0)) (< 0 (let ((.cse3 (select (let ((.cse4 (store (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse8 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse2)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse4 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse5 (select .cse4 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse3 (+ (* (select .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse20 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse19 (+ (select .cse20 .cse10) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse20 .cse10 (mod .cse19 4))))) (let ((.cse17 (select .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse18 (+ (select .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< 0 (let ((.cse13 (select (let ((.cse14 (store (store .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse17 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse18 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse14 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse15 (select .cse14 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse15 (+ 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset| (* (select .cse15 .cse6) 4)) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse13 (+ (* (select .cse13 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse19 0) (< v_ArrVal_507 1) (< .cse18 0)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse29 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse22 (+ (select .cse29 .cse10) 1))) (let ((.cse21 (mod .cse22 4))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse29 .cse10 (+ .cse21 (- 4)))))) (let ((.cse28 (select .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse23 (+ 1 (select .cse28 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (= .cse21 0) (not (< .cse22 0)) (< .cse23 0) (< v_ArrVal_507 1) (< 0 (let ((.cse24 (select (let ((.cse25 (store (store .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse28 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse23 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse25 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse26 (select .cse25 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse26 (+ (* (select .cse26 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse24 (+ (* (select .cse24 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse39 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse31 (+ (select .cse39 .cse10) 1))) (let ((.cse30 (mod .cse31 4))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse39 .cse10 (+ .cse30 (- 4)))))) (let ((.cse38 (select .cse37 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse32 (+ 1 (select .cse38 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (let ((.cse33 (mod .cse32 4))) (or (= .cse30 0) (not (< .cse31 0)) (not (< .cse32 0)) (= .cse33 0) (< 0 (let ((.cse34 (select (let ((.cse35 (store (store .cse37 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse38 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse33))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse35 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse36 (select .cse35 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse36 (+ (* (select .cse36 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse34 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse34 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4))))) (< v_ArrVal_507 1)))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse47 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse46 (+ (select .cse47 .cse10) 1))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse47 .cse10 (mod .cse46 4))))) (let ((.cse44 (select .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse45 (mod (+ (select .cse44 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< 0 (let ((.cse40 (select (let ((.cse41 (store (store .cse43 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse44 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse45)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse41 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse42 (select .cse41 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse42 (+ 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset| (* (select .cse42 .cse6) 4)) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse40 (+ (* (select .cse40 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< .cse46 0) (not (= .cse45 0)) (< v_ArrVal_507 1)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse55 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse54 (mod (+ (select .cse55 .cse10) 1) 4))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse55 .cse10 .cse54)))) (let ((.cse52 (select .cse51 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse53 (mod (+ (select .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))) (or (< 0 (let ((.cse48 (select (let ((.cse49 (store (store .cse51 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse52 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| .cse53)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse49 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse50 (select .cse49 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse50 (+ 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset| (* (select .cse50 .cse6) 4)) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse48 (+ (* (select .cse48 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (= .cse54 0)) (not (= .cse53 0)) (< v_ArrVal_507 1)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse64 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse57 (mod (+ (select .cse64 .cse10) 1) 4))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse64 .cse10 .cse57)))) (let ((.cse63 (select .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse58 (+ (select .cse63 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse56 (mod .cse58 4))) (or (= .cse56 0) (not (= .cse57 0)) (< v_ArrVal_507 1) (not (< .cse58 0)) (< 0 (let ((.cse59 (select (let ((.cse60 (store (store .cse62 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse63 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse56))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse60 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse61 (select .cse60 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse61 (+ (* (select .cse61 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse59 (+ (* (select .cse59 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))))))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse72 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse71 (mod (+ (select .cse72 .cse10) 1) 4))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse72 .cse10 .cse71)))) (let ((.cse69 (select .cse68 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse70 (+ (select .cse69 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (or (< 0 (let ((.cse65 (select (let ((.cse66 (store (store .cse68 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse69 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod .cse70 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse66 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse67 (select .cse66 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse67 (+ 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset| (* (select .cse67 .cse6) 4)) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse65 (+ (* (select .cse65 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (not (= .cse71 0)) (< v_ArrVal_507 1) (< .cse70 0)))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse81 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse73 (+ (select .cse81 .cse10) 1))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse81 .cse10 (mod .cse73 4))))) (let ((.cse80 (select .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse75 (+ (select .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (let ((.cse74 (mod .cse75 4))) (or (< .cse73 0) (= .cse74 0) (< v_ArrVal_507 1) (not (< .cse75 0)) (< 0 (let ((.cse76 (select (let ((.cse77 (store (store .cse79 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store .cse80 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) .cse74))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base| v_ArrVal_506))) (store .cse77 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse78 (select .cse77 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse78 (+ (* (select .cse78 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse76 (+ (* (select .cse76 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4))))))))))))))) is different from false [2023-05-04 19:52:35,875 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 160 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:52:38,193 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse6 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse11 .cse10) 4) 4))) (and (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse2 (+ (select .cse9 .cse10) 1))) (let ((.cse0 (mod .cse2 4))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse9 .cse10 (+ .cse0 (- 4)))))) (let ((.cse8 (select .cse7 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse1 (mod (+ (select .cse8 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1) 4))) (or (= .cse0 0) (not (= 0 .cse1)) (not (< .cse2 0)) (< 0 (let ((.cse3 (select (let ((.cse4 (store (store .cse7 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse8 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| .cse1)) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse4 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse5 (select .cse4 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse3 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4)))) (< v_ArrVal_507 1))))))))) (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse20 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse13 (mod (+ (select .cse20 .cse10) 1) 4))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse20 .cse10 .cse13)))) (let ((.cse19 (select .cse18 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse14 (+ (select .cse19 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1))) (or (not (= .cse13 0)) (< v_ArrVal_507 1) (< .cse14 0) (< 0 (let ((.cse15 (select (let ((.cse16 (store (store .cse18 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse19 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (mod .cse14 4))) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse16 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse17 (select .cse16 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse17 (+ (* (select .cse17 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse15 (+ (* 4 (select .cse15 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4))))))))))) (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse29 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse21 (+ (select .cse29 .cse10) 1))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse29 .cse10 (mod .cse21 4))))) (let ((.cse26 (select .cse25 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse28 (+ (select .cse26 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1))) (let ((.cse27 (mod .cse28 4))) (or (< .cse21 0) (< v_ArrVal_507 1) (< 0 (let ((.cse22 (select (let ((.cse23 (store (store .cse25 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse26 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (+ (- 4) .cse27))) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse23 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse24 (select .cse23 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse24 (+ (* (select .cse24 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse22 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse22 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4)))) (not (< .cse28 0)) (= .cse27 0))))))))))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse38 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse30 (mod (+ (select .cse38 .cse10) 1) 4))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse38 .cse10 .cse30)))) (let ((.cse35 (select .cse34 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse37 (+ (select .cse35 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1))) (let ((.cse36 (mod .cse37 4))) (or (not (= .cse30 0)) (< v_ArrVal_507 1) (< 0 (let ((.cse31 (select (let ((.cse32 (store (store .cse34 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse35 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (+ (- 4) .cse36))) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse32 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse33 (select .cse32 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse33 (+ (* (select .cse33 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse31 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse31 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4)))) (not (< .cse37 0)) (= .cse36 0))))))))) (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse46 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse40 (+ (select .cse46 .cse10) 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse46 .cse10 (mod .cse40 4))))) (let ((.cse45 (select .cse44 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse39 (mod (+ (select .cse45 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1) 4))) (or (not (= .cse39 0)) (< .cse40 0) (< v_ArrVal_507 1) (< 0 (let ((.cse41 (select (let ((.cse42 (store (store .cse44 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse45 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| .cse39)) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse42 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse43 (select .cse42 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse43 (+ (* (select .cse43 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse41 (+ (* 4 (select .cse41 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4))))))))))))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse54 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse47 (+ (select .cse54 .cse10) 1))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse54 .cse10 (mod .cse47 4))))) (let ((.cse53 (select .cse52 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse48 (+ (select .cse53 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1))) (or (< .cse47 0) (< v_ArrVal_507 1) (< .cse48 0) (< 0 (let ((.cse49 (select (let ((.cse50 (store (store .cse52 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse53 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (mod .cse48 4))) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse50 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse51 (select .cse50 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse51 (+ (* (select .cse51 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse49 (+ (* 4 (select .cse49 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4))))))))))) (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse63 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse56 (+ (select .cse63 .cse10) 1))) (let ((.cse55 (mod .cse56 4))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse63 .cse10 (+ .cse55 (- 4)))))) (let ((.cse61 (select .cse60 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse62 (+ (select .cse61 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1))) (or (= .cse55 0) (not (< .cse56 0)) (< 0 (let ((.cse57 (select (let ((.cse58 (store (store .cse60 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse61 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (mod .cse62 4))) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse58 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse59 (select .cse58 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse59 (+ (* (select .cse59 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse57 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse57 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4)))) (< v_ArrVal_507 1) (< .cse62 0))))))))) (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0)) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse73 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse71 (+ (select .cse73 .cse10) 1))) (let ((.cse64 (mod .cse71 4))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse73 .cse10 (+ .cse64 (- 4)))))) (let ((.cse69 (select .cse68 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse72 (+ (select .cse69 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1))) (let ((.cse70 (mod .cse72 4))) (or (= .cse64 0) (< 0 (let ((.cse65 (select (let ((.cse66 (store (store .cse68 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse69 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (+ (- 4) .cse70))) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse66 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse67 (select .cse66 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse67 (+ (* (select .cse67 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse65 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse65 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4)))) (not (< .cse71 0)) (= 0 .cse70) (< v_ArrVal_507 1) (not (< .cse72 0))))))))))))) (forall ((|v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| Int)) (or (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_507 Int) (v_ArrVal_501 Int)) (let ((.cse81 (store .cse11 .cse12 v_ArrVal_501))) (let ((.cse75 (mod (+ (select .cse81 .cse10) 1) 4))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse81 .cse10 .cse75)))) (let ((.cse80 (select .cse79 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse74 (mod (+ (select .cse80 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 1) 4))) (or (not (= .cse74 0)) (not (= .cse75 0)) (< v_ArrVal_507 1) (< 0 (let ((.cse76 (select (let ((.cse77 (store (store .cse79 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| (store .cse80 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| .cse74)) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34| v_ArrVal_506))) (store .cse77 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (let ((.cse78 (select .cse77 |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse78 (+ (* (select .cse78 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_507)) .cse6 v_ArrVal_509))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse76 (+ (* 4 (select .cse76 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4))))))))))) (not (= (select |c_#valid| |v_reader_twoThread1of1ForFork1_~#read~0#1.base_34|) 0))))))) is different from true [2023-05-04 19:54:52,336 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 160 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:58:31,611 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:58:51,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:58:51,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1156 treesize of output 706 [2023-05-04 19:58:51,697 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:58:51,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3134 treesize of output 3042 [2023-05-04 19:58:51,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:58:51,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:58:51,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 7886 treesize of output 5920 [2023-05-04 19:58:51,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:58:51,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:58:52,002 INFO L356 Elim1Store]: treesize reduction 23, result has 68.9 percent of original size [2023-05-04 19:58:52,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 1817380 treesize of output 1372884 [2023-05-04 19:59:28,559 WARN L233 SmtUtils]: Spent 36.55s on a formula simplification. DAG size of input: 1507 DAG size of output: 1507 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 19:59:31,355 INFO L356 Elim1Store]: treesize reduction 53, result has 49.0 percent of original size [2023-05-04 19:59:31,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 69549190 treesize of output 52009110 Received shutdown request... [2023-05-04 20:04:24,654 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 [2023-05-04 20:04:24,655 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 20:04:24,670 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 20:04:24,670 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 [2023-05-04 20:04:24,681 WARN L249 SmtUtils]: Removed 1 from assertion stack [2023-05-04 20:04:24,683 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 20:04:24,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 20:04:24,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-04 20:04:24,902 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 228 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-4-3-3-3-3-3-3-3-7-3-5-3-7-3-5-3-5-3-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-1 context. [2023-05-04 20:04:24,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-05-04 20:04:24,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-05-04 20:04:24,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-05-04 20:04:24,905 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 20:04:24,905 INFO L307 ceAbstractionStarter]: Result for error location reader_twoThread1of1ForFork1 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2023-05-04 20:04:24,906 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 20:04:24,906 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 20:04:24,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 08:04:24 BasicIcfg [2023-05-04 20:04:24,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 20:04:24,908 INFO L158 Benchmark]: Toolchain (without parser) took 867900.41ms. Allocated memory was 221.2MB in the beginning and 931.1MB in the end (delta: 709.9MB). Free memory was 188.9MB in the beginning and 347.9MB in the end (delta: -159.0MB). Peak memory consumption was 585.3MB. Max. memory is 8.0GB. [2023-05-04 20:04:24,908 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 221.2MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 20:04:24,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 844.95ms. Allocated memory was 221.2MB in the beginning and 361.8MB in the end (delta: 140.5MB). Free memory was 188.7MB in the beginning and 308.0MB in the end (delta: -119.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 20:04:24,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.88ms. Allocated memory is still 361.8MB. Free memory was 308.0MB in the beginning and 304.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 20:04:24,909 INFO L158 Benchmark]: Boogie Preprocessor took 47.36ms. Allocated memory is still 361.8MB. Free memory was 304.9MB in the beginning and 302.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 20:04:24,909 INFO L158 Benchmark]: RCFGBuilder took 479.08ms. Allocated memory is still 361.8MB. Free memory was 302.4MB in the beginning and 280.8MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-05-04 20:04:24,909 INFO L158 Benchmark]: TraceAbstraction took 866419.43ms. Allocated memory was 361.8MB in the beginning and 931.1MB in the end (delta: 569.4MB). Free memory was 279.7MB in the beginning and 347.9MB in the end (delta: -68.2MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. [2023-05-04 20:04:24,910 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.11ms. Allocated memory is still 221.2MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 844.95ms. Allocated memory was 221.2MB in the beginning and 361.8MB in the end (delta: 140.5MB). Free memory was 188.7MB in the beginning and 308.0MB in the end (delta: -119.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 104.88ms. Allocated memory is still 361.8MB. Free memory was 308.0MB in the beginning and 304.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.36ms. Allocated memory is still 361.8MB. Free memory was 304.9MB in the beginning and 302.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 479.08ms. Allocated memory is still 361.8MB. Free memory was 302.4MB in the beginning and 280.8MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 866419.43ms. Allocated memory was 361.8MB in the beginning and 931.1MB in the end (delta: 569.4MB). Free memory was 279.7MB in the beginning and 347.9MB in the end (delta: -68.2MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8396, independent: 8260, independent conditional: 94, independent unconditional: 8166, dependent: 136, dependent conditional: 70, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 94, independent unconditional: 8166, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 94, independent unconditional: 8166, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 0, independent unconditional: 8260, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 0, independent unconditional: 8260, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 0, independent unconditional: 8260, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7824, independent: 7758, independent conditional: 0, independent unconditional: 7758, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7824, independent: 7757, independent conditional: 0, independent unconditional: 7757, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 200, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8344, independent: 502, independent conditional: 0, independent unconditional: 502, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7824, unknown conditional: 0, unknown unconditional: 7824] , Statistics on independence cache: Total cache size (in pairs): 7824, Positive cache size: 7758, Positive conditional cache size: 0, Positive unconditional cache size: 7758, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 52 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 142, Number of trivial persistent sets: 118, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8232, independent: 8166, independent conditional: 0, independent unconditional: 8166, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8396, independent: 8260, independent conditional: 94, independent unconditional: 8166, dependent: 136, dependent conditional: 70, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 94, independent unconditional: 8166, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 94, independent unconditional: 8166, dependent: 84, dependent conditional: 18, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 0, independent unconditional: 8260, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 0, independent unconditional: 8260, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8344, independent: 8260, independent conditional: 0, independent unconditional: 8260, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7824, independent: 7758, independent conditional: 0, independent unconditional: 7758, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7824, independent: 7757, independent conditional: 0, independent unconditional: 7757, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 200, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8344, independent: 502, independent conditional: 0, independent unconditional: 502, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7824, unknown conditional: 0, unknown unconditional: 7824] , Statistics on independence cache: Total cache size (in pairs): 7824, Positive cache size: 7758, Positive conditional cache size: 0, Positive unconditional cache size: 7758, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 52 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32528, independent: 30049, independent conditional: 10711, independent unconditional: 19338, dependent: 2479, dependent conditional: 2399, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30152, independent: 30049, independent conditional: 10711, independent unconditional: 19338, dependent: 103, dependent conditional: 23, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30152, independent: 30049, independent conditional: 10711, independent unconditional: 19338, dependent: 103, dependent conditional: 23, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30309, independent: 30049, independent conditional: 8, independent unconditional: 30041, dependent: 260, dependent conditional: 149, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30309, independent: 30049, independent conditional: 8, independent unconditional: 30041, dependent: 260, dependent conditional: 45, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30309, independent: 30049, independent conditional: 8, independent unconditional: 30041, dependent: 260, dependent conditional: 45, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15028, independent: 14937, independent conditional: 2, independent unconditional: 14935, dependent: 91, dependent conditional: 11, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15028, independent: 14931, independent conditional: 0, independent unconditional: 14931, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 91, dependent conditional: 11, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 91, dependent conditional: 11, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 37, independent conditional: 9, independent unconditional: 28, dependent: 133, dependent conditional: 35, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30309, independent: 15112, independent conditional: 6, independent unconditional: 15106, dependent: 169, dependent conditional: 34, dependent unconditional: 135, unknown: 15028, unknown conditional: 13, unknown unconditional: 15015] , Statistics on independence cache: Total cache size (in pairs): 15028, Positive cache size: 14937, Positive conditional cache size: 2, Positive unconditional cache size: 14935, Negative cache size: 91, Negative conditional cache size: 11, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 104, Maximal queried relation: 11, Independence queries for same thread: 2376 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 483, Number of trivial persistent sets: 209, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19418, independent: 19338, independent conditional: 0, independent unconditional: 19338, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32528, independent: 30049, independent conditional: 10711, independent unconditional: 19338, dependent: 2479, dependent conditional: 2399, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30152, independent: 30049, independent conditional: 10711, independent unconditional: 19338, dependent: 103, dependent conditional: 23, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30152, independent: 30049, independent conditional: 10711, independent unconditional: 19338, dependent: 103, dependent conditional: 23, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30309, independent: 30049, independent conditional: 8, independent unconditional: 30041, dependent: 260, dependent conditional: 149, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30309, independent: 30049, independent conditional: 8, independent unconditional: 30041, dependent: 260, dependent conditional: 45, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30309, independent: 30049, independent conditional: 8, independent unconditional: 30041, dependent: 260, dependent conditional: 45, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15028, independent: 14937, independent conditional: 2, independent unconditional: 14935, dependent: 91, dependent conditional: 11, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15028, independent: 14931, independent conditional: 0, independent unconditional: 14931, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 91, dependent conditional: 11, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 91, dependent conditional: 11, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 37, independent conditional: 9, independent unconditional: 28, dependent: 133, dependent conditional: 35, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30309, independent: 15112, independent conditional: 6, independent unconditional: 15106, dependent: 169, dependent conditional: 34, dependent unconditional: 135, unknown: 15028, unknown conditional: 13, unknown unconditional: 15015] , Statistics on independence cache: Total cache size (in pairs): 15028, Positive cache size: 14937, Positive conditional cache size: 2, Positive unconditional cache size: 14935, Negative cache size: 91, Negative conditional cache size: 11, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 104, Maximal queried relation: 11, Independence queries for same thread: 2376 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 228 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-4-3-3-3-3-3-3-3-7-3-5-3-7-3-5-3-5-3-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 228 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-4-3-3-3-3-3-3-3-7-3-5-3-7-3-5-3-5-3-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 228 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-4-3-3-3-3-3-3-3-7-3-5-3-7-3-5-3-5-3-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-1 context. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 228 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-4-3-3-3-3-3-3-3-7-3-5-3-7-3-5-3-5-3-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: reader_twoThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 865.7s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 20.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 216, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 2282 NumberOfCodeBlocks, 2282 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2694 ConstructedInterpolants, 0 QuantifiedInterpolants, 17277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 232/265 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