/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.number.of.independence.relations.to.use.for.por 2 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL '--traceabstraction.abstraction.used.for.commutativity.in.por.#2' NONE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 15:38:19,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 15:38:19,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-07 15:38:19,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 15:38:19,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 15:38:19,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 15:38:19,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 15:38:19,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 15:38:19,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 15:38:19,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 15:38:19,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 15:38:19,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 15:38:19,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 15:38:19,239 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 15:38:19,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 15:38:19,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 15:38:19,240 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 15:38:19,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 15:38:19,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 15:38:19,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 15:38:19,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 15:38:19,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 15:38:19,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 15:38:19,242 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 15:38:19,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 15:38:19,242 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 15:38:19,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 15:38:19,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 15:38:19,243 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 15:38:19,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 15:38:19,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 15:38:19,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 15:38:19,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 15:38:19,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 15:38:19,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 15:38:19,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 15:38:19,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 15:38:19,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 15:38:19,245 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 15:38:19,245 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-07 15:38:19,245 INFO L153 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Number of independence relations to use for POR -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR #2 -> NONE [2023-09-07 15:38:19,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 15:38:19,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 15:38:19,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 15:38:19,542 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 15:38:19,542 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 15:38:19,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-09-07 15:38:20,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 15:38:20,953 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 15:38:20,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-09-07 15:38:20,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e39481b/485dcb372c994c45a7df10be68f40182/FLAG4b74eea74 [2023-09-07 15:38:20,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e39481b/485dcb372c994c45a7df10be68f40182 [2023-09-07 15:38:20,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 15:38:20,989 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 15:38:20,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 15:38:20,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 15:38:20,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 15:38:20,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 03:38:20" (1/1) ... [2023-09-07 15:38:20,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18aa9ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:20, skipping insertion in model container [2023-09-07 15:38:20,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 03:38:20" (1/1) ... [2023-09-07 15:38:21,041 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 15:38:21,193 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-07 15:38:21,386 WARN L240 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-09-07 15:38:21,391 WARN L240 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-09-07 15:38:21,393 WARN L240 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-09-07 15:38:21,453 WARN L240 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-09-07 15:38:21,456 WARN L240 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-09-07 15:38:21,458 WARN L240 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-09-07 15:38:21,459 WARN L240 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-09-07 15:38:21,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 15:38:21,483 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 15:38:21,493 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-07 15:38:21,519 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-09-07 15:38:21,520 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-09-07 15:38:21,530 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile long [805] [2023-09-07 15:38:21,530 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [806] [2023-09-07 15:38:21,530 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile long [807] [2023-09-07 15:38:21,531 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [809] [2023-09-07 15:38:21,532 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [814] [2023-09-07 15:38:21,532 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [815] [2023-09-07 15:38:21,540 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [827] [2023-09-07 15:38:21,542 WARN L240 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-09-07 15:38:21,543 WARN L240 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-09-07 15:38:21,544 WARN L240 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-09-07 15:38:21,547 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [843] [2023-09-07 15:38:21,552 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [899] [2023-09-07 15:38:21,558 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1054] [2023-09-07 15:38:21,564 WARN L240 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-09-07 15:38:21,565 WARN L240 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-09-07 15:38:21,566 WARN L240 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-09-07 15:38:21,566 WARN L240 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-09-07 15:38:21,569 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: long [1078] [2023-09-07 15:38:21,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 15:38:21,624 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 15:38:21,631 INFO L206 MainTranslator]: Completed translation [2023-09-07 15:38:21,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21 WrapperNode [2023-09-07 15:38:21,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 15:38:21,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 15:38:21,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 15:38:21,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 15:38:21,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,692 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 206 [2023-09-07 15:38:21,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 15:38:21,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 15:38:21,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 15:38:21,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 15:38:21,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 15:38:21,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 15:38:21,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 15:38:21,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 15:38:21,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (1/1) ... [2023-09-07 15:38:21,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 15:38:21,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:21,772 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-09-07 15:38:21,794 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-09-07 15:38:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2023-09-07 15:38:21,822 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2023-09-07 15:38:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2023-09-07 15:38:21,822 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2023-09-07 15:38:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 15:38:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 15:38:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 15:38:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 15:38:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-07 15:38:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 15:38:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 15:38:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 15:38:21,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 15:38:21,825 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 15:38:21,945 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 15:38:21,947 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 15:38:22,294 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 15:38:22,302 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 15:38:22,302 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-09-07 15:38:22,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 03:38:22 BoogieIcfgContainer [2023-09-07 15:38:22,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 15:38:22,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 15:38:22,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 15:38:22,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 15:38:22,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 03:38:20" (1/3) ... [2023-09-07 15:38:22,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73331620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 03:38:22, skipping insertion in model container [2023-09-07 15:38:22,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 03:38:21" (2/3) ... [2023-09-07 15:38:22,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73331620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 03:38:22, skipping insertion in model container [2023-09-07 15:38:22,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 03:38:22" (3/3) ... [2023-09-07 15:38:22,312 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2023-09-07 15:38:22,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 15:38:22,327 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 15:38:22,327 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-09-07 15:38:22,327 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 15:38:22,429 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-07 15:38:22,472 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 15:38:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:22,476 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-09-07 15:38:22,478 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-09-07 15:38:22,507 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,515 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 15:38:22,515 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 15:38:22,515 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 15:38:22,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 15:38:22,527 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;@7615dfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 15:38:22,530 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-09-07 15:38:22,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 15:38:22,538 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-09-07 15:38:22,540 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/10) [2023-09-07 15:38:22,548 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 15:38:22,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:22,595 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-09-07 15:38:22,597 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-09-07 15:38:22,600 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,602 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 15:38:22,602 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 15:38:22,603 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 15:38:22,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 15:38:22,604 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;@7615dfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 15:38:22,604 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-09-07 15:38:22,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 15:38:22,607 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-09-07 15:38:22,607 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/10) [2023-09-07 15:38:22,620 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 15:38:22,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:22,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 15:38:22,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-09-07 15:38:22,633 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,635 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 15:38:22,636 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 15:38:22,636 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 15:38:22,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 15:38:22,637 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;@7615dfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 15:38:22,637 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-09-07 15:38:22,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 15:38:22,640 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-09-07 15:38:22,640 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/10) [2023-09-07 15:38:22,655 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 15:38:22,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:22,660 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 15:38:22,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-09-07 15:38:22,666 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,667 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 15:38:22,667 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 15:38:22,667 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 15:38:22,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 15:38:22,668 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;@7615dfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 15:38:22,669 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-09-07 15:38:22,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 15:38:22,671 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-09-07 15:38:22,671 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/10) [2023-09-07 15:38:22,679 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 15:38:22,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:22,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 15:38:22,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-09-07 15:38:22,692 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,693 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 15:38:22,694 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 15:38:22,694 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 15:38:22,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-09-07 15:38:22,695 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;@7615dfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:22,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 15:38:23,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-09-07 15:38:23,036 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-09-07 15:38:23,036 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (5/10) [2023-09-07 15:38:23,040 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 15:38:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:23,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 15:38:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-09-07 15:38:23,058 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:23,059 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 15:38:23,059 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 15:38:23,059 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 15:38:23,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-09-07 15:38:23,060 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;@7615dfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:23,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 15:38:23,064 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-09-07 15:38:23,065 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-09-07 15:38:23,065 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (6/10) [2023-09-07 15:38:23,068 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:23,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 15:38:23,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:23,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 15:38:23,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-09-07 15:38:23,082 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:23,085 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-07 15:38:23,085 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-07 15:38:23,086 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-07 15:38:23,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 15:38:23,086 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;@7615dfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 15:38:23,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-09-07 15:38:28,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 15:38:28,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 15:38:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1530564498, now seen corresponding path program 1 times [2023-09-07 15:38:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 15:38:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882085771] [2023-09-07 15:38:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 15:38:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 15:38:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 15:38:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 15:38:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 15:38:29,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882085771] [2023-09-07 15:38:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882085771] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 15:38:29,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 15:38:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-09-07 15:38:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994220935] [2023-09-07 15:38:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 15:38:29,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-07 15:38:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 15:38:29,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-07 15:38:29,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2023-09-07 15:38:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 15:38:29,942 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 15:38:29,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 0 states have call successors, (0), 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-09-07 15:38:29,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 15:38:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-09-07 15:38:35,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 15:38:35,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 15:38:35,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 15:38:35,992 INFO L85 PathProgramCache]: Analyzing trace with hash 51979694, now seen corresponding path program 1 times [2023-09-07 15:38:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 15:38:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833484719] [2023-09-07 15:38:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 15:38:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 15:38:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 15:38:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 15:38:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 15:38:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833484719] [2023-09-07 15:38:39,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833484719] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 15:38:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925798583] [2023-09-07 15:38:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 15:38:39,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 15:38:39,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:38:39,294 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 15:38:39,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-07 15:38:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 15:38:39,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 90 conjunts are in the unsatisfiable core [2023-09-07 15:38:39,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 15:38:39,490 INFO L351 Elim1Store]: Elim1 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-09-07 15:38:39,523 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-09-07 15:38:39,523 INFO L351 Elim1Store]: Elim1 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-09-07 15:38:39,543 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-07 15:38:39,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-09-07 15:38:39,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-07 15:38:39,609 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-09-07 15:38:39,640 INFO L351 Elim1Store]: Elim1 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 21 treesize of output 21 [2023-09-07 15:38:39,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-07 15:38:40,685 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:38:40,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-09-07 15:38:40,956 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:38:40,957 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2023-09-07 15:38:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 15:38:41,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 15:38:42,823 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< v_ArrVal_69 1) (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))))) is different from false [2023-09-07 15:38:43,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< v_ArrVal_69 1) (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse0 (+ 4 (* (select .cse0 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))))) is different from false [2023-09-07 15:38:43,108 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4)))) (< v_ArrVal_69 1))) is different from false [2023-09-07 15:38:43,271 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) 4) 4) v_ArrVal_69)))) (select .cse0 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< v_ArrVal_69 1))) is different from false [2023-09-07 15:38:43,301 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< v_ArrVal_69 1) (< 0 (let ((.cse0 (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) |c_ULTIMATE.start_ring_init_~r#1.offset| 0)) |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) 4) 4) v_ArrVal_69)))) (select .cse0 (+ (* 4 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|)) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))))) is different from false [2023-09-07 15:38:43,316 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:38:43,316 INFO L351 Elim1Store]: Elim1 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 120 treesize of output 87 [2023-09-07 15:38:43,329 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:38:43,330 INFO L351 Elim1Store]: Elim1 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 392 treesize of output 380 [2023-09-07 15:38:43,346 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:38:43,374 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:38:43,376 INFO L351 Elim1Store]: Elim1 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 178 treesize of output 167 [2023-09-07 15:38:43,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:38:43,426 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:38:43,427 INFO L351 Elim1Store]: Elim1 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 268 treesize of output 197 [2023-09-07 15:38:43,484 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:38:43,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 9 [2023-09-07 15:38:43,868 INFO L322 Elim1Store]: treesize reduction 10, result has 92.4 percent of original size [2023-09-07 15:38:43,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 219 [2023-09-07 15:38:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-09-07 15:38:47,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925798583] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 15:38:47,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 15:38:47,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 31] total 73 [2023-09-07 15:38:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630985243] [2023-09-07 15:38:47,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 15:38:47,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-09-07 15:38:47,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 15:38:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-09-07 15:38:47,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4323, Unknown=23, NotChecked=680, Total=5256 [2023-09-07 15:38:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 15:38:47,204 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 15:38:47,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.684931506849315) internal successors, (269), 73 states have internal predecessors, (269), 0 states have call successors, (0), 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-09-07 15:38:47,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-09-07 15:38:47,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 15:39:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-09-07 15:39:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-09-07 15:39:38,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-09-07 15:39:38,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-09-07 15:39:38,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 15:39:38,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 15:39:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1194280584, now seen corresponding path program 1 times [2023-09-07 15:39:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 15:39:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036461164] [2023-09-07 15:39:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 15:39:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 15:39:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 15:39:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 15:39:43,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 15:39:43,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036461164] [2023-09-07 15:39:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036461164] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 15:39:43,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420547717] [2023-09-07 15:39:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 15:39:43,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 15:39:43,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 15:39:43,335 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 15:39:43,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-07 15:39:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 15:39:43,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 145 conjunts are in the unsatisfiable core [2023-09-07 15:39:43,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 15:39:43,521 INFO L351 Elim1Store]: Elim1 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-09-07 15:39:43,536 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-07 15:39:43,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-07 15:39:43,593 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-07 15:39:43,593 INFO L351 Elim1Store]: Elim1 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-09-07 15:39:43,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-07 15:39:43,810 INFO L351 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-09-07 15:39:44,341 INFO L351 Elim1Store]: Elim1 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 21 treesize of output 21 [2023-09-07 15:39:45,448 INFO L322 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-09-07 15:39:45,448 INFO L351 Elim1Store]: Elim1 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 43 treesize of output 44 [2023-09-07 15:39:45,814 INFO L322 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2023-09-07 15:39:45,814 INFO L351 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 109 [2023-09-07 15:39:48,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-07 15:39:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 15:39:48,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 15:41:02,818 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4)) (.cse5 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse9 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse10 (select .cse9 .cse7))) (let ((.cse11 (mod (+ .cse10 1) 4)) (.cse12 (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse6 (store .cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse10 4) 4) v_ArrVal_138))) (let ((.cse4 (store .cse6 .cse7 0))) (let ((.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse4 .cse8 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse0 (+ (* .cse1 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse1 (select .cse0 .cse2)) (< v_ArrVal_142 2) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| .cse4) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5))) (not (= (mod (+ (select .cse6 .cse7) 1) 4) 0)) (< v_ArrVal_138 1))))))) (= .cse11 (+ .cse12 4)) (= .cse11 .cse12))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse19 (select .cse16 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse20 (select .cse19 .cse7))) (let ((.cse13 (+ .cse20 1))) (or (< .cse13 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse18 (store .cse19 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse20 4) 4) v_ArrVal_138))) (let ((.cse17 (store .cse18 .cse7 0))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse17 .cse8 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse15 (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse14 (+ (* .cse15 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse15 (select .cse14 .cse2)) (< v_ArrVal_142 2) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| .cse17) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5))) (not (= (mod (+ (select .cse18 .cse7) 1) 4) 0)) (< v_ArrVal_138 1))))))) (= (mod .cse13 4) (select .cse19 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse28 (select .cse24 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse29 (select .cse28 .cse7))) (let ((.cse21 (+ .cse29 1))) (or (< .cse21 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse27 (store .cse28 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse29 4) 4) v_ArrVal_138))) (let ((.cse26 (mod (+ (select .cse27 .cse7) 1) 4))) (let ((.cse25 (store .cse27 .cse7 .cse26))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse25 (+ (* .cse26 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse23 (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse22 .cse2) .cse23) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (< 0 (select .cse22 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse23 4) 4))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| .cse25) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5)))))))))) (= (mod .cse21 4) (select .cse28 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse30 (select .cse35 .cse7))) (or (not (= (mod (+ .cse30 1) 4) 0)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse34 (store (store .cse35 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse30 4) 4) v_ArrVal_138) .cse7 0))) (let ((.cse31 (select (store .cse33 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse34 .cse8 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse32 (select .cse31 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse31 (+ (* .cse32 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse32 (select .cse31 .cse2)) (< v_ArrVal_142 2) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store .cse33 |c_ULTIMATE.start_main_~#r~3#1.base| .cse34) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5))) (< v_ArrVal_138 1)))))) (= (select .cse35 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse44 (select .cse40 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse36 (select .cse44 .cse7))) (or (not (= (mod (+ .cse36 1) 4) 0)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse43 (store .cse44 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse36 4) 4) v_ArrVal_138))) (let ((.cse39 (+ (select .cse43 .cse7) 1))) (let ((.cse42 (mod .cse39 4))) (let ((.cse41 (store .cse43 .cse7 .cse42))) (let ((.cse37 (select (store .cse40 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse41 (+ (* .cse42 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse38 (select .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse37 .cse2) .cse38) (< .cse39 0) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (< 0 (select .cse37 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse38 4) 4))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store .cse40 |c_ULTIMATE.start_main_~#r~3#1.base| .cse41) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5))))))))))) (= (select .cse44 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse52 (select .cse48 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse53 (select .cse52 .cse7))) (let ((.cse54 (mod (+ .cse53 1) 4)) (.cse55 (select .cse52 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse51 (store .cse52 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse53 4) 4) v_ArrVal_138))) (let ((.cse47 (+ (select .cse51 .cse7) 1))) (let ((.cse50 (mod .cse47 4))) (let ((.cse49 (store .cse51 .cse7 .cse50))) (let ((.cse45 (select (store .cse48 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse49 (+ (* .cse50 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse46 (select .cse45 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse45 .cse2) .cse46) (< .cse47 0) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (< 0 (select .cse45 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse46 4) 4))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store .cse48 |c_ULTIMATE.start_main_~#r~3#1.base| .cse49) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5))))))))))) (= .cse54 (+ .cse55 4)) (= .cse54 .cse55))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse64 (select .cse63 .cse7))) (let ((.cse65 (mod (+ .cse64 1) 4)) (.cse66 (select .cse63 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse62 (store .cse63 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse64 4) 4) v_ArrVal_138))) (let ((.cse61 (select .cse62 .cse7))) (let ((.cse60 (mod (+ .cse61 1) 4))) (let ((.cse59 (store .cse62 .cse7 (+ (- 4) .cse60)))) (let ((.cse56 (select (store .cse58 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse59 (+ (* .cse60 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse57 (select .cse56 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse56 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse57 4) 4))) (< v_ArrVal_142 2) (not (= (select (select (store .cse58 |c_ULTIMATE.start_main_~#r~3#1.base| .cse59) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (= .cse57 (select .cse56 .cse2)) (< v_ArrVal_138 1) (= .cse60 0) (< 0 (+ 2 .cse61)))))))))) (= .cse65 (+ .cse66 4)) (= .cse65 .cse66))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse68 (select .cse75 .cse7))) (let ((.cse67 (mod (+ .cse68 1) 4))) (or (= .cse67 0) (< 0 (+ .cse68 2)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse74 (store .cse75 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse68 4) 4) v_ArrVal_138))) (let ((.cse73 (mod (+ (select .cse74 .cse7) 1) 4))) (let ((.cse72 (store .cse74 .cse7 (+ (- 4) .cse73)))) (let ((.cse69 (select (store .cse71 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse72 (+ (* .cse73 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse70 (select .cse69 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse69 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse70 4) 4))) (< v_ArrVal_142 2) (not (= (select (select (store .cse71 |c_ULTIMATE.start_main_~#r~3#1.base| .cse72) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse5) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (= .cse70 (select .cse69 .cse2)) (< v_ArrVal_138 1)))))))) (= .cse67 (+ (select .cse75 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))))))) is different from false [2023-09-07 15:41:08,009 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4)) (.cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse6 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse9 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse11 (select .cse7 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse12 (select .cse11 .cse5))) (let ((.cse0 (+ .cse12 1))) (or (< .cse0 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse4 (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse12 4) 4) v_ArrVal_138))) (let ((.cse8 (store .cse4 .cse5 0))) (let ((.cse1 (select (store .cse7 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse8 .cse10 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse2 (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse1 (+ (* .cse2 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse2 (select .cse1 .cse3)) (< v_ArrVal_142 2) (not (= (mod (+ (select .cse4 .cse5) 1) 4) 0)) (< v_ArrVal_138 1) (not (= .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#r~3#1.base| .cse8) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))))))))) (= (mod .cse0 4) (select .cse11 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse20 (select .cse16 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse21 (select .cse20 .cse5))) (let ((.cse22 (mod (+ .cse21 1) 4)) (.cse23 (select .cse20 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse19 (store .cse20 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse21 4) 4) v_ArrVal_138))) (let ((.cse15 (+ (select .cse19 .cse5) 1))) (let ((.cse18 (mod .cse15 4))) (let ((.cse17 (store .cse19 .cse5 .cse18))) (let ((.cse13 (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse17 (+ (* .cse18 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse14 (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse13 .cse3) .cse14) (< .cse15 0) (not (= .cse6 (select (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| .cse17) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (< 0 (select .cse13 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse14 4) 4))))))))))) (= .cse22 (+ .cse23 4)) (= .cse22 .cse23))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse32 (select .cse26 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse25 (select .cse32 .cse5))) (let ((.cse24 (mod (+ .cse25 1) 4))) (or (= .cse24 0) (< 0 (+ .cse25 2)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse31 (store .cse32 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse25 4) 4) v_ArrVal_138))) (let ((.cse30 (mod (+ (select .cse31 .cse5) 1) 4))) (let ((.cse27 (store .cse31 .cse5 (+ (- 4) .cse30)))) (let ((.cse28 (select (store .cse26 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse27 (+ (* .cse30 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse29 (select .cse28 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= (select (select (store .cse26 |c_ULTIMATE.start_main_~#r~3#1.base| .cse27) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) .cse6)) (< 0 (select .cse28 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse29 4) 4))) (< v_ArrVal_142 2) (= .cse29 (select .cse28 .cse3)) (< v_ArrVal_138 1)))))))) (= .cse24 (+ (select .cse32 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse38 (select .cse36 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse33 (select .cse38 .cse5))) (or (not (= (mod (+ .cse33 1) 4) 0)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse37 (store (store .cse38 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse33 4) 4) v_ArrVal_138) .cse5 0))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse37 .cse10 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse35 (select .cse34 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse34 (+ (* .cse35 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse35 (select .cse34 .cse3)) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (not (= .cse6 (select (select (store .cse36 |c_ULTIMATE.start_main_~#r~3#1.base| .cse37) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))) (= (select .cse38 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse44 (select .cse42 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse45 (select .cse44 .cse5))) (let ((.cse46 (mod (+ .cse45 1) 4)) (.cse47 (select .cse44 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse41 (store .cse44 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse45 4) 4) v_ArrVal_138))) (let ((.cse43 (store .cse41 .cse5 0))) (let ((.cse39 (select (store .cse42 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse43 .cse10 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse40 (select .cse39 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse39 (+ (* .cse40 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse40 (select .cse39 .cse3)) (< v_ArrVal_142 2) (not (= (mod (+ (select .cse41 .cse5) 1) 4) 0)) (< v_ArrVal_138 1) (not (= .cse6 (select (select (store .cse42 |c_ULTIMATE.start_main_~#r~3#1.base| .cse43) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))))))))) (= .cse46 (+ .cse47 4)) (= .cse46 .cse47))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse55 (select .cse48 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse56 (select .cse55 .cse5))) (let ((.cse57 (mod (+ .cse56 1) 4)) (.cse58 (select .cse55 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse54 (store .cse55 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse56 4) 4) v_ArrVal_138))) (let ((.cse53 (select .cse54 .cse5))) (let ((.cse52 (mod (+ .cse53 1) 4))) (let ((.cse49 (store .cse54 .cse5 (+ (- 4) .cse52)))) (let ((.cse50 (select (store .cse48 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse49 (+ (* .cse52 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse51 (select .cse50 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= (select (select (store .cse48 |c_ULTIMATE.start_main_~#r~3#1.base| .cse49) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) .cse6)) (< 0 (select .cse50 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse51 4) 4))) (< v_ArrVal_142 2) (= .cse51 (select .cse50 .cse3)) (< v_ArrVal_138 1) (= .cse52 0) (< 0 (+ 2 .cse53)))))))))) (= .cse57 (+ .cse58 4)) (= .cse57 .cse58))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse60 (select .cse63 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse67 (select .cse60 .cse5))) (let ((.cse59 (+ .cse67 1))) (or (< .cse59 0) (= (mod .cse59 4) (select .cse60 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse66 (store .cse60 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse67 4) 4) v_ArrVal_138))) (let ((.cse65 (mod (+ (select .cse66 .cse5) 1) 4))) (let ((.cse64 (store .cse66 .cse5 .cse65))) (let ((.cse61 (select (store .cse63 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse64 (+ (* .cse65 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse62 (select .cse61 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse61 .cse3) .cse62) (not (= .cse6 (select (select (store .cse63 |c_ULTIMATE.start_main_~#r~3#1.base| .cse64) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (< 0 (select .cse61 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse62 4) 4)))))))))))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse76 (select .cse72 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse68 (select .cse76 .cse5))) (or (not (= (mod (+ .cse68 1) 4) 0)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse75 (store .cse76 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse68 4) 4) v_ArrVal_138))) (let ((.cse71 (+ (select .cse75 .cse5) 1))) (let ((.cse74 (mod .cse71 4))) (let ((.cse73 (store .cse75 .cse5 .cse74))) (let ((.cse69 (select (store .cse72 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse73 (+ (* .cse74 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse70 (select .cse69 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse69 .cse3) .cse70) (< .cse71 0) (not (= .cse6 (select (select (store .cse72 |c_ULTIMATE.start_main_~#r~3#1.base| .cse73) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (< 0 (select .cse69 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse70 4) 4))))))))))) (= (select .cse76 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)))))))) is different from false [2023-09-07 15:41:09,195 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4)) (.cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse7 (+ |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| 20)) (.cse4 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse11 (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (let ((.cse0 (+ .cse12 1))) (or (< .cse0 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse8 (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse12 4) 4) v_ArrVal_138))) (let ((.cse6 (store .cse8 .cse9 0))) (let ((.cse1 (select (store .cse5 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse6 .cse10 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse2 (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse1 (+ (* .cse2 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse2 (select .cse1 .cse3)) (< v_ArrVal_142 2) (not (= .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#r~3#1.base| .cse6) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7))) (not (= (mod (+ (select .cse8 .cse9) 1) 4) 0)) (< v_ArrVal_138 1))))))) (= (mod .cse0 4) (select .cse11 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse20 (select .cse16 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse21 (select .cse20 .cse9))) (let ((.cse13 (mod (+ .cse21 1) 4))) (or (= .cse13 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse19 (store .cse20 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse21 4) 4) v_ArrVal_138))) (let ((.cse18 (mod (+ (select .cse19 .cse9) 1) 4))) (let ((.cse17 (store .cse19 .cse9 (+ (- 4) .cse18)))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse17 (+ (* .cse18 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse15 (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse14 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse15 4) 4))) (< v_ArrVal_142 2) (not (= (select (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| .cse17) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7) .cse4)) (= .cse15 (select .cse14 .cse3)) (< v_ArrVal_138 1)))))))) (< 0 (+ .cse21 2)) (= .cse13 (+ (select .cse20 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse29 (select .cse24 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse30 (select .cse29 .cse9))) (let ((.cse31 (mod (+ .cse30 1) 4)) (.cse32 (select .cse29 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse28 (store .cse29 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse30 4) 4) v_ArrVal_138))) (let ((.cse27 (select .cse28 .cse9))) (let ((.cse26 (mod (+ .cse27 1) 4))) (let ((.cse25 (store .cse28 .cse9 (+ (- 4) .cse26)))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse25 (+ (* .cse26 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse23 (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse22 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse23 4) 4))) (< v_ArrVal_142 2) (not (= (select (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| .cse25) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7) .cse4)) (= .cse23 (select .cse22 .cse3)) (< v_ArrVal_138 1) (= .cse26 0) (< 0 (+ 2 .cse27)))))))))) (= .cse31 (+ .cse32 4)) (= .cse31 .cse32))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse39 (select .cse35 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse40 (select .cse39 .cse9))) (let ((.cse41 (+ .cse40 1))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse38 (store .cse39 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse40 4) 4) v_ArrVal_138))) (let ((.cse37 (mod (+ (select .cse38 .cse9) 1) 4))) (let ((.cse36 (store .cse38 .cse9 .cse37))) (let ((.cse33 (select (store .cse35 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse36 (+ (* .cse37 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse34 (select .cse33 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse33 .cse3) .cse34) (< v_ArrVal_142 2) (not (= (select (select (store .cse35 |c_ULTIMATE.start_main_~#r~3#1.base| .cse36) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7) .cse4)) (< v_ArrVal_138 1) (< 0 (select .cse33 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse34 4) 4)))))))))) (< .cse41 0) (= (mod .cse41 4) (select .cse39 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse49 (select .cse46 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse50 (select .cse49 .cse9))) (let ((.cse42 (mod (+ .cse50 1) 4)) (.cse43 (select .cse49 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (= .cse42 (+ .cse43 4)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse48 (store .cse49 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse50 4) 4) v_ArrVal_138))) (let ((.cse47 (store .cse48 .cse9 0))) (let ((.cse44 (select (store .cse46 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse47 .cse10 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse45 (select .cse44 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse44 (+ (* .cse45 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse45 (select .cse44 .cse3)) (< v_ArrVal_142 2) (not (= .cse4 (select (select (store .cse46 |c_ULTIMATE.start_main_~#r~3#1.base| .cse47) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7))) (not (= (mod (+ (select .cse48 .cse9) 1) 4) 0)) (< v_ArrVal_138 1))))))) (= .cse42 .cse43))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse58 (select .cse54 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse59 (select .cse58 .cse9))) (let ((.cse60 (mod (+ .cse59 1) 4)) (.cse61 (select .cse58 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse57 (store .cse58 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse59 4) 4) v_ArrVal_138))) (let ((.cse53 (+ (select .cse57 .cse9) 1))) (let ((.cse56 (mod .cse53 4))) (let ((.cse55 (store .cse57 .cse9 .cse56))) (let ((.cse51 (select (store .cse54 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse55 (+ (* .cse56 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse52 (select .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse51 .cse3) .cse52) (< .cse53 0) (< v_ArrVal_142 2) (not (= (select (select (store .cse54 |c_ULTIMATE.start_main_~#r~3#1.base| .cse55) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7) .cse4)) (< v_ArrVal_138 1) (< 0 (select .cse51 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse52 4) 4))))))))))) (= .cse60 (+ .cse61 4)) (= .cse60 .cse61))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse63 (select .cse66 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse62 (select .cse63 .cse9))) (or (not (= (mod (+ .cse62 1) 4) 0)) (= (select .cse63 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse67 (store (store .cse63 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse62 4) 4) v_ArrVal_138) .cse9 0))) (let ((.cse64 (select (store .cse66 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse67 .cse10 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse65 (select .cse64 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse64 (+ (* .cse65 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse65 (select .cse64 .cse3)) (< v_ArrVal_142 2) (not (= .cse4 (select (select (store .cse66 |c_ULTIMATE.start_main_~#r~3#1.base| .cse67) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7))) (< v_ArrVal_138 1))))))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse76 (select .cse75 .cse9))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse74 (store .cse75 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse76 4) 4) v_ArrVal_138))) (let ((.cse70 (+ (select .cse74 .cse9) 1))) (let ((.cse73 (mod .cse70 4))) (let ((.cse72 (store .cse74 .cse9 .cse73))) (let ((.cse68 (select (store .cse71 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse72 (+ (* .cse73 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse69 (select .cse68 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse68 .cse3) .cse69) (< .cse70 0) (< v_ArrVal_142 2) (not (= (select (select (store .cse71 |c_ULTIMATE.start_main_~#r~3#1.base| .cse72) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) .cse7) .cse4)) (< v_ArrVal_138 1) (< 0 (select .cse68 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse69 4) 4))))))))))) (not (= (mod (+ .cse76 1) 4) 0)) (= (select .cse75 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)))))))) is different from false [2023-09-07 15:41:12,551 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4)) (.cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse6 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse10 (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse11 (select .cse10 .cse8))) (let ((.cse0 (+ .cse11 1))) (or (< .cse0 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse7 (store .cse10 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse11 4) 4) v_ArrVal_138))) (let ((.cse5 (store .cse7 .cse8 0))) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse5 .cse9 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse2 (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse1 (+ (* .cse2 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse2 (select .cse1 .cse3)) (< v_ArrVal_142 2) (not (= (select (select (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| .cse5) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (not (= (mod (+ (select .cse7 .cse8) 1) 4) 0)) (< v_ArrVal_138 1))))))) (= (mod .cse0 4) (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse19 (select .cse15 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse20 (select .cse19 .cse8))) (let ((.cse12 (+ .cse20 1))) (or (< .cse12 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse18 (store .cse19 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse20 4) 4) v_ArrVal_138))) (let ((.cse17 (mod (+ (select .cse18 .cse8) 1) 4))) (let ((.cse16 (store .cse18 .cse8 .cse17))) (let ((.cse13 (select (store .cse15 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse16 (+ (* .cse17 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse14 (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse13 .cse3) .cse14) (< v_ArrVal_142 2) (not (= (select (select (store .cse15 |c_ULTIMATE.start_main_~#r~3#1.base| .cse16) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (< v_ArrVal_138 1) (< 0 (select .cse13 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse14 4) 4)))))))))) (= (mod .cse12 4) (select .cse19 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse26 (select .cse24 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse21 (select .cse26 .cse8))) (or (not (= (mod (+ .cse21 1) 4) 0)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse25 (store (store .cse26 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse21 4) 4) v_ArrVal_138) .cse8 0))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse25 .cse9 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse23 (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse22 (+ (* .cse23 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse23 (select .cse22 .cse3)) (< v_ArrVal_142 2) (not (= (select (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| .cse25) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (< v_ArrVal_138 1)))))) (= (select .cse26 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse34 (select .cse29 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse35 (select .cse34 .cse8))) (let ((.cse36 (mod (+ .cse35 1) 4)) (.cse37 (select .cse34 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse33 (store .cse34 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse35 4) 4) v_ArrVal_138))) (let ((.cse32 (select .cse33 .cse8))) (let ((.cse31 (mod (+ .cse32 1) 4))) (let ((.cse30 (store .cse33 .cse8 (+ (- 4) .cse31)))) (let ((.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse30 (+ (* .cse31 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse28 (select .cse27 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse27 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse28 4) 4))) (< v_ArrVal_142 2) (not (= (select (select (store .cse29 |c_ULTIMATE.start_main_~#r~3#1.base| .cse30) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (= .cse28 (select .cse27 .cse3)) (< v_ArrVal_138 1) (= .cse31 0) (< 0 (+ 2 .cse32)))))))))) (= .cse36 (+ .cse37 4)) (= .cse36 .cse37))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse45 (select .cse41 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse46 (select .cse45 .cse8))) (let ((.cse47 (mod (+ .cse46 1) 4)) (.cse48 (select .cse45 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse44 (store .cse45 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse46 4) 4) v_ArrVal_138))) (let ((.cse40 (+ (select .cse44 .cse8) 1))) (let ((.cse43 (mod .cse40 4))) (let ((.cse42 (store .cse44 .cse8 .cse43))) (let ((.cse38 (select (store .cse41 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse42 (+ (* .cse43 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse39 (select .cse38 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse38 .cse3) .cse39) (< .cse40 0) (< v_ArrVal_142 2) (not (= (select (select (store .cse41 |c_ULTIMATE.start_main_~#r~3#1.base| .cse42) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (< v_ArrVal_138 1) (< 0 (select .cse38 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse39 4) 4))))))))))) (= .cse47 (+ .cse48 4)) (= .cse47 .cse48))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse54 (select .cse51 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse55 (select .cse54 .cse8))) (let ((.cse56 (mod (+ .cse55 1) 4)) (.cse57 (select .cse54 |c_ULTIMATE.start_main_~#r~3#1.offset|))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse53 (store .cse54 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse55 4) 4) v_ArrVal_138))) (let ((.cse52 (store .cse53 .cse8 0))) (let ((.cse49 (select (store .cse51 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse52 .cse9 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse50 (select .cse49 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse49 (+ (* .cse50 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse50 (select .cse49 .cse3)) (< v_ArrVal_142 2) (not (= (select (select (store .cse51 |c_ULTIMATE.start_main_~#r~3#1.base| .cse52) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (not (= (mod (+ (select .cse53 .cse8) 1) 4) 0)) (< v_ArrVal_138 1))))))) (= .cse56 (+ .cse57 4)) (= .cse56 .cse57))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse60 (select .cse63 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse59 (select .cse60 .cse8))) (let ((.cse58 (mod (+ .cse59 1) 4))) (or (= .cse58 0) (< 0 (+ .cse59 2)) (= .cse58 (+ (select .cse60 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse66 (store .cse60 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse59 4) 4) v_ArrVal_138))) (let ((.cse65 (mod (+ (select .cse66 .cse8) 1) 4))) (let ((.cse64 (store .cse66 .cse8 (+ (- 4) .cse65)))) (let ((.cse61 (select (store .cse63 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse64 (+ (* .cse65 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse62 (select .cse61 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse61 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse62 4) 4))) (< v_ArrVal_142 2) (not (= (select (select (store .cse63 |c_ULTIMATE.start_main_~#r~3#1.base| .cse64) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (= .cse62 (select .cse61 .cse3)) (< v_ArrVal_138 1)))))))))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse67 (select .cse75 .cse8))) (or (not (= (mod (+ .cse67 1) 4) 0)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse74 (store .cse75 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse67 4) 4) v_ArrVal_138))) (let ((.cse70 (+ (select .cse74 .cse8) 1))) (let ((.cse73 (mod .cse70 4))) (let ((.cse72 (store .cse74 .cse8 .cse73))) (let ((.cse68 (select (store .cse71 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse72 (+ (* .cse73 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse69 (select .cse68 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse68 .cse3) .cse69) (< .cse70 0) (< v_ArrVal_142 2) (not (= (select (select (store .cse71 |c_ULTIMATE.start_main_~#r~3#1.base| .cse72) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse3) .cse6)) (< v_ArrVal_138 1) (< 0 (select .cse68 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse69 4) 4))))))))))) (= (select .cse75 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)))))))) is different from false [2023-09-07 15:41:56,478 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|)) (.cse5 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 20)) (.cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse9 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse10 (select .cse9 .cse8))) (let ((.cse11 (mod (+ .cse10 1) 4))) (or (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse7 (store .cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse10 4) 4) v_ArrVal_138))) (let ((.cse6 (mod (+ (select .cse7 .cse8) 1) 4))) (let ((.cse4 (store .cse7 .cse8 (+ (- 4) .cse6)))) (let ((.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse4 (+ (* .cse6 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|))) (or (< v_ArrVal_142 2) (< 0 (select .cse0 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4 (* .cse1 4)))) (not (= .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| .cse4) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) .cse5))) (< v_ArrVal_138 1) (= (select .cse0 .cse5) .cse1)))))))) (= .cse11 0) (< 0 (+ .cse10 2)) (= .cse11 (+ (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse12 (select .cse13 .cse8))) (or (not (= (mod (+ .cse12 1) 4) 0)) (= (select .cse13 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse17 (store (store .cse13 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse12 4) 4) v_ArrVal_138) .cse8 0))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse17 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (let ((.cse15 (select .cse14 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|))) (or (< v_ArrVal_142 2) (< 0 (select .cse14 (+ (* .cse15 4) |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4))) (= .cse15 (select .cse14 .cse5)) (< v_ArrVal_138 1) (not (= .cse2 (select (select (store .cse16 |c_ULTIMATE.start_main_~#r~3#1.base| .cse17) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) .cse5))))))))))))) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse25 (select .cse21 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse26 (select .cse25 .cse8))) (let ((.cse18 (+ .cse26 1))) (or (< .cse18 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse24 (store .cse25 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse26 4) 4) v_ArrVal_138))) (let ((.cse23 (mod (+ (select .cse24 .cse8) 1) 4))) (let ((.cse22 (store .cse24 .cse8 .cse23))) (let ((.cse19 (select (store .cse21 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse22 (+ (* .cse23 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (let ((.cse20 (select .cse19 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|))) (or (= (select .cse19 .cse5) .cse20) (< v_ArrVal_142 2) (< 0 (select .cse19 (+ (* .cse20 4) |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4))) (< v_ArrVal_138 1) (not (= .cse2 (select (select (store .cse21 |c_ULTIMATE.start_main_~#r~3#1.base| .cse22) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) .cse5)))))))))) (= (mod .cse18 4) (select .cse25 |c_ULTIMATE.start_main_~#r~3#1.offset|)))))))))) is different from false [2023-09-07 15:42:00,077 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_135))) (let ((.cse1 (select (store .cse3 |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse2 (select .cse1 .cse7))) (let ((.cse0 (mod (+ .cse2 1) 4))) (or (= .cse0 0) (= (+ (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) .cse0) (< 0 (+ 2 .cse2)) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse6 (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse2 4) 4) v_ArrVal_138))) (let ((.cse4 (mod (+ (select .cse6 .cse7) 1) 4))) (or (not (= (+ (select (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|) |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) .cse4)) (< v_ArrVal_142 2) (< 0 (let ((.cse5 (store (store .cse6 .cse7 (+ (- 4) .cse4)) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12) (* 4 .cse4)) v_ArrVal_142))) (select .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< v_ArrVal_138 1))))))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_135))) (let ((.cse13 (select (store .cse9 |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse14 (select .cse13 .cse7))) (let ((.cse8 (+ .cse14 1))) (or (< .cse8 0) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse12 (store .cse13 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse14 4) 4) v_ArrVal_138))) (let ((.cse10 (mod (+ (select .cse12 .cse7) 1) 4))) (or (not (= (select (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.base|) |c_ULTIMATE.start_main_~#r~3#1.offset|) .cse10)) (< 0 (let ((.cse11 (store (store .cse12 .cse7 .cse10) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 .cse10) 4) v_ArrVal_142))) (select .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse11 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< v_ArrVal_142 2) (< v_ArrVal_138 1))))) (= (select .cse13 |c_ULTIMATE.start_main_~#r~3#1.offset|) (mod .cse8 4)))))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_135))) (or (not (= (select (select .cse15 |c_ULTIMATE.start_main_~#r~3#1.base|) |c_ULTIMATE.start_main_~#r~3#1.offset|) 0)) (forall ((v_ArrVal_142 Int) (v_ArrVal_136 (Array Int Int)) (v_ArrVal_138 Int)) (let ((.cse18 (select (store .cse15 |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse16 (select .cse18 .cse7))) (or (not (= (mod (+ .cse16 1) 4) 0)) (< v_ArrVal_142 2) (< 0 (let ((.cse17 (store .cse18 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse16 4) 4) v_ArrVal_138))) (select (store (store .cse17 .cse7 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse17 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (= (select .cse18 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (< v_ArrVal_138 1)))))))))) is different from false [2023-09-07 15:42:00,508 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:00,508 INFO L351 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 511 treesize of output 367 [2023-09-07 15:42:00,561 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:00,562 INFO L351 Elim1Store]: Elim1 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 2427 treesize of output 2337 [2023-09-07 15:42:00,645 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:42:00,645 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:42:01,028 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:01,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 6179 treesize of output 4744 [2023-09-07 15:42:01,249 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:42:01,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:42:01,560 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:01,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 8485 treesize of output 6578 [2023-09-07 15:42:01,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-09-07 15:42:02,602 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:02,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 32 [2023-09-07 15:42:04,646 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:04,647 INFO L351 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 476 treesize of output 340 [2023-09-07 15:42:04,716 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-07 15:42:04,717 INFO L351 Elim1Store]: Elim1 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 2186 treesize of output 2096 [2023-09-07 15:42:04,761 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:42:04,915 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:04,915 INFO L351 Elim1Store]: Elim1 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 6909 treesize of output 4401 [2023-09-07 15:42:05,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:42:05,268 INFO L322 Elim1Store]: treesize reduction 66, result has 16.5 percent of original size [2023-09-07 15:42:05,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 3532 treesize of output 2393 [2023-09-07 15:42:05,445 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 15:42:05,561 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 15:42:05,562 INFO L351 Elim1Store]: Elim1 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 2525 treesize of output 1819 [2023-09-07 15:42:07,441 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-07 15:42:07,441 INFO L351 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 179 treesize of output 1 [2023-09-07 15:42:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-09-07 15:42:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420547717] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 15:42:08,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 15:42:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 46, 52] total 134 [2023-09-07 15:42:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874841924] [2023-09-07 15:42:08,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 15:42:08,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2023-09-07 15:42:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 15:42:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2023-09-07 15:42:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=15376, Unknown=36, NotChecked=1542, Total=17822 [2023-09-07 15:42:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 15:42:08,953 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 15:42:08,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 2.716417910447761) internal successors, (364), 134 states have internal predecessors, (364), 0 states have call successors, (0), 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-09-07 15:42:08,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-09-07 15:42:08,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2023-09-07 15:42:08,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 15:43:17,040 WARN L234 SmtUtils]: Spent 10.28s on a formula simplification. DAG size of input: 365 DAG size of output: 339 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 15:43:19,428 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse34 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse99 (select .cse37 .cse34))) (let ((.cse97 (mod (+ .cse99 1) 4))) (let ((.cse95 (= .cse97 0)) (.cse98 (select .cse37 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse96 (+ 2 .cse99))) (let ((.cse27 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse29 (and (not .cse95) (= .cse97 (+ .cse98 4)) (<= .cse96 0))) (.cse36 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) (.cse38 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse99 4) 4)) (.cse30 (and (or .cse95 (< 0 .cse96)) (= .cse97 .cse98))) (.cse8 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse9 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse51 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|)) (.cse26 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|)) (.cse52 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (and (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base|)) (.cse12 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| 20))) (let ((.cse25 (select .cse13 .cse12))) (let ((.cse0 (mod (+ .cse25 1) 4))) (let ((.cse2 (= .cse0 0)) (.cse3 (+ 2 .cse25)) (.cse1 (select .cse13 |c_ULTIMATE.start_writer_fn_~arg#1.offset|))) (or (and (= .cse0 (+ .cse1 4)) (not .cse2) (<= .cse3 0)) (and (or .cse2 (< 0 .cse3)) (= .cse1 .cse0)) (let ((.cse14 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* .cse25 4) 4))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse11 (store .cse13 .cse14 v_ArrVal_138))) (let ((.cse6 (+ (select .cse11 .cse12) 1))) (let ((.cse10 (mod .cse6 4))) (let ((.cse7 (store .cse11 .cse12 .cse10))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse7 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* 4 .cse10) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse5 (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_142 2) (< 0 (select .cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse5 4)))) (< .cse6 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse7) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (< v_ArrVal_138 1) (= (select .cse4 .cse9) .cse5))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse16 (store .cse13 .cse14 v_ArrVal_138))) (let ((.cse15 (store .cse16 .cse12 0))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse15 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse18 (select .cse17 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse15) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (not (= 0 (mod (+ (select .cse16 .cse12) 1) 4))) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (= (select .cse17 .cse9) .cse18) (< 0 (select .cse17 (+ (* .cse18 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse24 (store .cse13 .cse14 v_ArrVal_138))) (let ((.cse20 (select .cse24 .cse12))) (let ((.cse19 (mod (+ .cse20 1) 4))) (let ((.cse23 (store .cse24 .cse12 (+ (- 4) .cse19)))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse23 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* 4 .cse19) (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse22 (select .cse21 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= 0 .cse19) (< 0 (+ 2 .cse20)) (< v_ArrVal_142 2) (< 0 (select .cse21 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse22 4)))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse23) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (< v_ArrVal_138 1) (= (select .cse21 .cse9) .cse22)))))))))))))))) (= (select .cse26 20) 0) (= (select .cse27 0) 0) (= (select .cse28 0) 0) (or .cse29 .cse30 (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse33 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse35 (store .cse33 .cse34 0))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse35 .cse36 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse32 (select .cse31 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse31 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse32 4)))) (not (= (mod (+ (select .cse33 .cse34) 1) 4) 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse35) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (< v_ArrVal_142 2) (= .cse32 (select .cse31 .cse9)) (< v_ArrVal_138 1))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse44 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse39 (+ (select .cse44 .cse34) 1))) (let ((.cse43 (mod .cse39 4))) (let ((.cse42 (store .cse44 .cse34 .cse43))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse42 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse43 4) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse41 (select .cse40 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< .cse39 0) (< v_ArrVal_142 2) (< 0 (select .cse40 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse41 4) 4))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse42) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (< v_ArrVal_138 1) (= (select .cse40 .cse9) .cse41))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse50 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse48 (select .cse50 .cse34))) (let ((.cse49 (mod (+ .cse48 1) 4))) (let ((.cse45 (store .cse50 .cse34 (+ .cse49 (- 4))))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse45 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse49 4) (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse47 (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse45) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (select .cse46 (+ (* .cse47 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< 0 (+ 2 .cse48)) (= .cse49 0) (< v_ArrVal_142 2) (= .cse47 (select .cse46 .cse9)) (< v_ArrVal_138 1))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_#in~r#1.base|) (= (select .cse51 20) 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| 0) (= (select .cse52 0) 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= (select .cse27 20) 0) (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|)) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~arg#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|)) (= (select .cse28 20) 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) (= |c_ULTIMATE.start_ring_init_#in~r#1.offset| 0) (or .cse29 (let ((.cse58 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 2)) (.cse59 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 1))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse60 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse56 (select .cse60 .cse34))) (let ((.cse57 (mod (+ .cse56 1) 4))) (let ((.cse53 (store .cse60 .cse34 (+ .cse57 (- 4))))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse53 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse57 4) (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse55 (select .cse54 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse53) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (select .cse54 (+ (* .cse55 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< 0 (+ 2 .cse56)) (= .cse57 0) (< v_ArrVal_142 .cse58) (= .cse55 (select .cse54 .cse9)) (< v_ArrVal_138 .cse59))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse66 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse61 (+ (select .cse66 .cse34) 1))) (let ((.cse65 (mod .cse61 4))) (let ((.cse64 (store .cse66 .cse34 .cse65))) (let ((.cse62 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse64 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse65 4) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse63 (select .cse62 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< .cse61 0) (< 0 (select .cse62 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse63 4) 4))) (< v_ArrVal_142 .cse58) (< v_ArrVal_138 .cse59) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse64) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (= (select .cse62 .cse9) .cse63))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse69 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse70 (store .cse69 .cse34 0))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse70 .cse36 v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse68 (select .cse67 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse67 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse68 4)))) (not (= (mod (+ (select .cse69 .cse34) 1) 4) 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse70) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (= .cse68 (select .cse67 .cse9)) (< v_ArrVal_142 .cse58) (< v_ArrVal_138 .cse59))))))))) .cse30) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| 0) (let ((.cse82 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base|)) (.cse81 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 20))) (let ((.cse94 (select .cse82 .cse81))) (let ((.cse71 (mod (+ .cse94 1) 4))) (let ((.cse74 (= .cse71 0)) (.cse73 (+ 2 .cse94)) (.cse72 (select .cse82 |c_ULTIMATE.start_writer_fn_#in~arg#1.offset|))) (or (and (= .cse71 .cse72) (or (< 0 .cse73) .cse74)) (and (not .cse74) (<= .cse73 0) (= (+ 4 .cse72) .cse71)) (let ((.cse83 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 4 (* 4 .cse94)))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse80 (store .cse82 .cse83 v_ArrVal_138))) (let ((.cse78 (+ (select .cse80 .cse81) 1))) (let ((.cse79 (mod .cse78 4))) (let ((.cse75 (store .cse80 .cse81 .cse79))) (let ((.cse76 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse75 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 4 (* .cse79 4)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse77 (select .cse76 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse75) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (< v_ArrVal_142 2) (= (select .cse76 .cse9) .cse77) (< 0 (select .cse76 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 .cse77) 4))) (< v_ArrVal_138 1) (< .cse78 0))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse89 (store .cse82 .cse83 v_ArrVal_138))) (let ((.cse88 (select .cse89 .cse81))) (let ((.cse87 (mod (+ .cse88 1) 4))) (let ((.cse86 (store .cse89 .cse81 (+ (- 4) .cse87)))) (let ((.cse84 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse86 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| (- 12) (* .cse87 4)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse85 (select .cse84 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= (select .cse84 .cse9) .cse85) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse86) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8))) (< v_ArrVal_142 2) (= .cse87 0) (< v_ArrVal_138 1) (< 0 (select .cse84 (+ (* .cse85 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< 0 (+ 2 .cse88)))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse92 (store .cse82 .cse83 v_ArrVal_138))) (let ((.cse93 (store .cse92 .cse81 0))) (let ((.cse90 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse93 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse91 (select .cse90 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse90 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse91 4) 4))) (not (= (mod (+ (select .cse92 .cse81) 1) 4) 0)) (< v_ArrVal_142 2) (< v_ArrVal_138 1) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse93) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse8) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (= (select .cse90 .cse9) .cse91)))))))))))))) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) 20) 0) (= (select .cse51 0) 0) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (= (select .cse26 0) 0) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= (select .cse52 20) 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (= |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 0) (= |c_ULTIMATE.start_ring_init_~r#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_~arg#1.offset| 0))))))) is different from true [2023-09-07 15:43:41,220 WARN L234 SmtUtils]: Spent 15.68s on a formula simplification that was a NOOP. DAG size: 215 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 15:43:43,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:43:45,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:43:47,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:43:49,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:43:51,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:44:40,260 WARN L234 SmtUtils]: Spent 38.80s on a formula simplification that was a NOOP. DAG size: 314 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 15:44:42,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:44:44,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:44:45,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:44:47,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:44:49,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:44:51,450 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse11 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse95 (select .cse12 .cse11))) (let ((.cse97 (mod (+ .cse95 1) 4))) (let ((.cse99 (+ 2 .cse95)) (.cse96 (= .cse97 0)) (.cse98 (select .cse12 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|))) (let ((.cse25 (and (or (< 0 .cse99) .cse96) (= .cse97 .cse98))) (.cse26 (and (not .cse96) (= .cse97 (+ .cse98 4)) (<= .cse99 0))) (.cse9 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 2)) (.cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse6 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) (.cse13 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse95 4)))) (and (or (and (forall ((v_ArrVal_138 Int)) (let ((.cse10 (store .cse12 .cse13 v_ArrVal_138))) (let ((.cse8 (select .cse10 .cse11))) (let ((.cse7 (mod (+ .cse8 1) 4))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse10 .cse11 (+ (- 4) .cse7))))) (or (forall ((v_ArrVal_142 Int)) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse5 (select .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select .cse5 .cse6)) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse1 4) 4))) (< v_ArrVal_142 .cse2) (= .cse1 (select .cse0 .cse3)))))) (= .cse7 0) (< 0 (+ 2 .cse8)) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|) (not (= (select (select .cse4 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)))))))) (forall ((v_ArrVal_142 Int)) (or (forall ((v_ArrVal_138 Int)) (let ((.cse19 (store .cse12 .cse13 v_ArrVal_138))) (let ((.cse17 (+ (select .cse19 .cse11) 1))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse19 .cse11 (mod .cse17 4))))) (let ((.cse15 (select (store .cse14 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse18 (select .cse14 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse18 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse18 .cse6) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse16 (select .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse14 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (< 0 (select .cse15 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse16 4) 4))) (= (select .cse15 .cse3) .cse16) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|) (< .cse17 0)))))))) (< v_ArrVal_142 .cse2))) (forall ((v_ArrVal_142 Int)) (or (forall ((v_ArrVal_138 Int)) (let ((.cse22 (store .cse12 .cse13 v_ArrVal_138))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse22 .cse11 0)))) (let ((.cse20 (select (store .cse23 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse24 (select .cse23 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse24 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse24 .cse6) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse21 (select .cse20 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse20 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse21 4) 4))) (not (= (mod (+ (select .cse22 .cse11) 1) 4) 0)) (not (= (select (select .cse23 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (= (select .cse20 .cse3) .cse21) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|))))))) (< v_ArrVal_142 .cse2)))) .cse25 .cse26) (let ((.cse39 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse38 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (let ((.cse52 (select .cse39 .cse38))) (let ((.cse29 (mod (+ 1 .cse52) 4))) (let ((.cse30 (select .cse39 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (.cse27 (= .cse29 0)) (.cse28 (+ 2 .cse52))) (or (and (not .cse27) (<= .cse28 0) (= .cse29 (+ 4 .cse30))) (and (= .cse29 .cse30) (or .cse27 (< 0 .cse28))) (let ((.cse40 (+ (* 4 .cse52) 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse37 (store .cse39 .cse40 v_ArrVal_138))) (let ((.cse33 (select .cse37 .cse38))) (let ((.cse31 (mod (+ .cse33 1) 4))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse37 .cse38 (+ (- 4) .cse31))))) (let ((.cse34 (select (store .cse32 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse36 (select .cse32 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse36 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse36 .cse6) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse35 (select .cse34 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (= .cse31 0) (not (= (select (select .cse32 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (+ 2 .cse33)) (< 0 (select .cse34 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse35 4) 4))) (< v_ArrVal_142 .cse2) (= .cse35 (select .cse34 .cse3)))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse46 (store .cse39 .cse40 v_ArrVal_138))) (let ((.cse43 (+ (select .cse46 .cse38) 1))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse46 .cse38 (mod .cse43 4))))) (let ((.cse41 (select (store .cse44 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse45 (select .cse44 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse45 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse45 .cse6) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse42 (select .cse41 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< 0 (select .cse41 (+ (* .cse42 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< .cse43 0) (= .cse42 (select .cse41 .cse3)) (< v_ArrVal_142 .cse2) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse44 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse50 (store .cse39 .cse40 v_ArrVal_138))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse50 .cse38 0)))) (let ((.cse47 (select (store .cse49 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse51 (select .cse49 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse51 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select .cse51 .cse6)) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse48 (select .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< 0 (select .cse47 (+ (* .cse48 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< v_ArrVal_142 .cse2) (= .cse48 (select .cse47 .cse3)) (not (= (select (select .cse49 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (not (= (mod (+ (select .cse50 .cse38) 1) 4) 0))))))))))))))) (let ((.cse64 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (let ((.cse76 (select .cse64 .cse6))) (let ((.cse54 (mod (+ .cse76 1) 4))) (let ((.cse53 (= .cse54 0)) (.cse56 (+ 2 .cse76)) (.cse55 (select .cse64 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|))) (or (and (not .cse53) (= .cse54 (+ .cse55 4)) (<= .cse56 0)) (let ((.cse62 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 1)) (.cse65 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse76 4) 4))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse63 (store .cse64 .cse65 v_ArrVal_138))) (let ((.cse60 (select .cse63 .cse6))) (let ((.cse61 (mod (+ .cse60 1) 4))) (let ((.cse57 (store .cse63 .cse6 (+ .cse61 (- 4))))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse57 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse61 4) (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse59 (select .cse58 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse57) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (select .cse58 (+ (* .cse59 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< 0 (+ 2 .cse60)) (= .cse61 0) (< v_ArrVal_142 .cse2) (= .cse59 (select .cse58 .cse3)) (< v_ArrVal_138 .cse62))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse71 (store .cse64 .cse65 v_ArrVal_138))) (let ((.cse66 (+ (select .cse71 .cse6) 1))) (let ((.cse70 (mod .cse66 4))) (let ((.cse69 (store .cse71 .cse6 .cse70))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse69 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse70 4) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse68 (select .cse67 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< .cse66 0) (< 0 (select .cse67 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse68 4) 4))) (< v_ArrVal_142 .cse2) (< v_ArrVal_138 .cse62) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse69) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (= (select .cse67 .cse3) .cse68))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse74 (store .cse64 .cse65 v_ArrVal_138))) (let ((.cse75 (store .cse74 .cse6 0))) (let ((.cse72 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse75 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse73 (select .cse72 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse72 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse73 4)))) (not (= (mod (+ (select .cse74 .cse6) 1) 4) 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse75) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (= .cse73 (select .cse72 .cse3)) (< v_ArrVal_142 .cse2) (< v_ArrVal_138 .cse62))))))))) (and (or .cse53 (< 0 .cse56)) (= .cse54 .cse55))))))) (or .cse25 .cse26 (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse83 (store .cse12 .cse13 v_ArrVal_138))) (let ((.cse80 (select .cse83 .cse11))) (let ((.cse77 (mod (+ .cse80 1) 4))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse83 .cse11 (+ (- 4) .cse77))))) (let ((.cse78 (select (store .cse81 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse82 (select .cse81 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse82 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select .cse82 .cse6)) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse79 (select .cse78 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (= .cse77 0) (< 0 (select .cse78 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse79 4) 4))) (< v_ArrVal_142 .cse2) (= .cse79 (select .cse78 .cse3)) (< 0 (+ 2 .cse80)) (not (= (select (select .cse81 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse89 (store .cse12 .cse13 v_ArrVal_138))) (let ((.cse87 (+ (select .cse89 .cse11) 1))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse89 .cse11 (mod .cse87 4))))) (let ((.cse85 (select (store .cse84 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse88 (select .cse84 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse88 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse88 .cse6) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse86 (select .cse85 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse84 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (< 0 (select .cse85 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse86 4) 4))) (= (select .cse85 .cse3) .cse86) (< v_ArrVal_142 .cse2) (< .cse87 0)))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse92 (store .cse12 .cse13 v_ArrVal_138))) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse92 .cse11 0)))) (let ((.cse90 (select (store .cse93 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse94 (select .cse93 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse94 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse94 .cse6) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse91 (select .cse90 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< 0 (select .cse90 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse91 4) 4))) (not (= (mod (+ (select .cse92 .cse11) 1) 4) 0)) (not (= (select (select .cse93 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< v_ArrVal_142 .cse2) (= (select .cse90 .cse3) .cse91))))))))))))))) is different from true [2023-09-07 15:45:01,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:04,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:06,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:08,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:10,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:12,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:14,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:16,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:18,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:20,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:22,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:26,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:28,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:30,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:32,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:45:56,725 WARN L234 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 15:45:59,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:01,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:04,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:06,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:08,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:10,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:12,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:15,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:18,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:20,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:50,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:54,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:46:57,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:02,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:03,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:05,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:16,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:18,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:20,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:37,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:40,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:42,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:44,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:46,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:48,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:50,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:52,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:54,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:56,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:47:59,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:01,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:03,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:05,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:07,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:09,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:11,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:13,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:15,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:17,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:20,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:22,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:24,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:26,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:29,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:31,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:32,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:34,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:36,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:38,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:40,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:42,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:44,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:46,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:49,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:51,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:53,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:55,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:57,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:48:59,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:01,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:04,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:06,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:08,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:10,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:12,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:14,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:17,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:19,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:21,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:23,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:26,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:28,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:30,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:32,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:33,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:35,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:38,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:40,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:42,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:43,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:45,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:47,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:49,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:51,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:53,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:55,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:49:58,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:00,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:03,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:05,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:07,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:09,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:11,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:13,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:15,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:17,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:20,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:22,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:25,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:27,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:29,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:31,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:33,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:35,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:37,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:40,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:42,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:44,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:47,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:49,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:51,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:53,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:55,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:57,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:50:59,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:01,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:03,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:05,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:07,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:09,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:11,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:13,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:15,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:18,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:20,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:22,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:24,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:26,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:28,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:30,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:33,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:35,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:37,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:39,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:41,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:43,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:45,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:47,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:49,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:51,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:54,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:56,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:51:58,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:00,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:02,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:04,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:07,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:09,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:11,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:13,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-09-07 15:52:15,125 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 15:52:15,126 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 15:52:15,126 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 15:52:15,125 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 15:52:15,125 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 15:52:15,125 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 15:52:15,125 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-09-07 15:52:15,125 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-09-07 15:52:15,125 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-09-07 15:52:15,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-07 15:52:15,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-07 15:52:15,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 15:52:15,627 WARN L619 AbstractCegarLoop]: Verification canceled: while executing OptimisticBudget. [2023-09-07 15:52:15,628 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 15:52:15,630 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-09-07 15:52:15,630 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (7/10) [2023-09-07 15:52:15,633 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-07 15:52:15,633 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-07 15:52:15,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 03:52:15 BasicIcfg [2023-09-07 15:52:15,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-07 15:52:15,637 INFO L158 Benchmark]: Toolchain (without parser) took 834648.42ms. Allocated memory was 161.5MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 115.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 7.0GB. [2023-09-07 15:52:15,637 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 161.5MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 15:52:15,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.35ms. Allocated memory is still 161.5MB. Free memory was 115.5MB in the beginning and 80.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 7.0GB. [2023-09-07 15:52:15,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.71ms. Allocated memory is still 161.5MB. Free memory was 80.9MB in the beginning and 77.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-07 15:52:15,638 INFO L158 Benchmark]: Boogie Preprocessor took 46.23ms. Allocated memory is still 161.5MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 15:52:15,638 INFO L158 Benchmark]: RCFGBuilder took 564.38ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 75.7MB in the beginning and 194.0MB in the end (delta: -118.3MB). Peak memory consumption was 8.4MB. Max. memory is 7.0GB. [2023-09-07 15:52:15,638 INFO L158 Benchmark]: TraceAbstraction took 833329.94ms. Allocated memory was 243.3MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 193.4MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 7.0GB. [2023-09-07 15:52:15,639 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 161.5MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 642.35ms. Allocated memory is still 161.5MB. Free memory was 115.5MB in the beginning and 80.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 59.71ms. Allocated memory is still 161.5MB. Free memory was 80.9MB in the beginning and 77.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 46.23ms. Allocated memory is still 161.5MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 564.38ms. Allocated memory was 161.5MB in the beginning and 243.3MB in the end (delta: 81.8MB). Free memory was 75.7MB in the beginning and 194.0MB in the end (delta: -118.3MB). Peak memory consumption was 8.4MB. Max. memory is 7.0GB. * TraceAbstraction took 833329.94ms. Allocated memory was 243.3MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 193.4MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 805]: Unsoundness Warning unspecified type, defaulting to int C: volatile long [805] - GenericResultAtLocation [Line: 806]: Unsoundness Warning unspecified type, defaulting to int C: long [806] - GenericResultAtLocation [Line: 807]: Unsoundness Warning unspecified type, defaulting to int C: volatile long [807] - GenericResultAtLocation [Line: 809]: Unsoundness Warning unspecified type, defaulting to int C: long [809] - GenericResultAtLocation [Line: 814]: Unsoundness Warning unspecified type, defaulting to int C: long [814] - GenericResultAtLocation [Line: 815]: Unsoundness Warning unspecified type, defaulting to int C: long [815] - GenericResultAtLocation [Line: 827]: Unsoundness Warning unspecified type, defaulting to int C: long [827] - GenericResultAtLocation [Line: 843]: Unsoundness Warning unspecified type, defaulting to int C: long [843] - GenericResultAtLocation [Line: 899]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [899] - GenericResultAtLocation [Line: 1054]: Unsoundness Warning unspecified type, defaulting to int C: long [1054] - GenericResultAtLocation [Line: 1078]: Unsoundness Warning unspecified type, defaulting to int C: long [1078] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1212, independent: 1021, independent conditional: 1021, independent unconditional: 0, dependent: 191, dependent conditional: 191, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1212, independent: 1021, independent conditional: 1021, independent unconditional: 0, dependent: 191, dependent conditional: 191, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1037, independent: 1021, independent conditional: 1021, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1037, independent: 1021, independent conditional: 1021, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1037, independent: 1021, independent conditional: 0, independent unconditional: 1021, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1037, independent: 1021, independent conditional: 0, independent unconditional: 1021, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1037, independent: 1021, independent conditional: 0, independent unconditional: 1021, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 516, independent: 508, independent conditional: 0, independent unconditional: 508, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 516, independent: 508, independent conditional: 0, independent unconditional: 508, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1037, independent: 513, independent conditional: 0, independent unconditional: 513, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 516, unknown conditional: 0, unknown unconditional: 516] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 508, Positive conditional cache size: 0, Positive unconditional cache size: 508, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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: 175, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 200259, independent: 182655, independent conditional: 182655, independent unconditional: 0, dependent: 17604, dependent conditional: 17604, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1889461, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 202434, dependent conditional: 202434, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 10049, dependent unconditional: 5405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1702481, independent: 1674100, independent conditional: 0, independent unconditional: 1674100, dependent: 15398, dependent conditional: 0, dependent unconditional: 15398, unknown: 12983, unknown conditional: 0, unknown unconditional: 12983] , Statistics on independence cache: Total cache size (in pairs): 5731, Positive cache size: 5731, Positive conditional cache size: 0, Positive unconditional cache size: 5731, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 17604, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 386896, independent: 346212, independent conditional: 346212, independent unconditional: 0, dependent: 40684, dependent conditional: 40684, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1889461, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 202434, dependent conditional: 202434, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 10049, dependent unconditional: 5405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1702481, independent: 1674100, independent conditional: 0, independent unconditional: 1674100, dependent: 15398, dependent conditional: 0, dependent unconditional: 15398, unknown: 12983, unknown conditional: 0, unknown unconditional: 12983] , Statistics on independence cache: Total cache size (in pairs): 8559, Positive cache size: 8541, Positive conditional cache size: 0, Positive unconditional cache size: 8541, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 792, Maximal queried relation: 1, Independence queries for same thread: 57496, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1295053, independent: 1151498, independent conditional: 1151498, independent unconditional: 0, dependent: 143555, dependent conditional: 143555, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1889461, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 202434, dependent conditional: 202434, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 10049, dependent unconditional: 5405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1702481, independent: 1674100, independent conditional: 0, independent unconditional: 1674100, dependent: 15398, dependent conditional: 0, dependent unconditional: 15398, unknown: 12983, unknown conditional: 0, unknown unconditional: 12983] , Statistics on independence cache: Total cache size (in pairs): 12668, Positive cache size: 12618, Positive conditional cache size: 0, Positive unconditional cache size: 12618, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9956, Maximal queried relation: 2, Independence queries for same thread: 196469, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7253, independent: 6662, independent conditional: 6662, independent unconditional: 0, dependent: 591, dependent conditional: 591, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1889461, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 202434, dependent conditional: 202434, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1692432, independent: 1687027, independent conditional: 1687027, independent unconditional: 0, dependent: 5405, dependent conditional: 5405, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 10049, dependent unconditional: 5405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1702481, independent: 1687027, independent conditional: 0, independent unconditional: 1687027, dependent: 15454, dependent conditional: 0, dependent unconditional: 15454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12983, independent: 12927, independent conditional: 0, independent unconditional: 12927, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1702481, independent: 1674100, independent conditional: 0, independent unconditional: 1674100, dependent: 15398, dependent conditional: 0, dependent unconditional: 15398, unknown: 12983, unknown conditional: 0, unknown unconditional: 12983] , Statistics on independence cache: Total cache size (in pairs): 12983, Positive cache size: 12927, Positive conditional cache size: 0, Positive unconditional cache size: 12927, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10049, Maximal queried relation: 3, Independence queries for same thread: 197029, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 138527, independent: 131724, independent conditional: 131724, independent unconditional: 0, dependent: 6803, dependent conditional: 6803, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133052, independent: 131724, independent conditional: 131724, independent unconditional: 0, dependent: 1328, dependent conditional: 1328, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133052, independent: 131724, independent conditional: 131724, independent unconditional: 0, dependent: 1328, dependent conditional: 1328, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135130, independent: 131724, independent conditional: 2, independent unconditional: 131722, dependent: 3406, dependent conditional: 2076, dependent unconditional: 1330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135130, independent: 131724, independent conditional: 2, independent unconditional: 131722, dependent: 3406, dependent conditional: 473, dependent unconditional: 2933, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135130, independent: 131724, independent conditional: 2, independent unconditional: 131722, dependent: 3406, dependent conditional: 473, dependent unconditional: 2933, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2555, independent: 2403, independent conditional: 2, independent unconditional: 2401, dependent: 152, dependent conditional: 124, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2555, independent: 2399, independent conditional: 0, independent unconditional: 2399, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 156, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 152, dependent conditional: 124, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 156, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 152, dependent conditional: 124, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 777, independent: 10, independent conditional: 5, independent unconditional: 5, dependent: 767, dependent conditional: 654, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 135130, independent: 129321, independent conditional: 0, independent unconditional: 129321, dependent: 3254, dependent conditional: 349, dependent unconditional: 2905, unknown: 2555, unknown conditional: 126, unknown unconditional: 2429] , Statistics on independence cache: Total cache size (in pairs): 2555, Positive cache size: 2403, Positive conditional cache size: 2, Positive unconditional cache size: 2401, Negative cache size: 152, Negative conditional cache size: 124, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1603, Maximal queried relation: 2, Independence queries for same thread: 5475 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing OptimisticBudget. - PositiveResult [Line: 1061]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1064]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1065]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 317 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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 error location: reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 5 procedures, 317 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 832.5s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 669.0s, 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: 177, 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, 162.4s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 872 ConstructedInterpolants, 158 QuantifiedInterpolants, 153817 SizeOfPredicates, 96 NumberOfNonLiveVariables, 697 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/114 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 317 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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 error location: reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 317 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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 error location: reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 317 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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 thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 317 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, 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 thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 317 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown