/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-15 02:45:46,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 02:45:46,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 02:45:46,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 02:45:46,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 02:45:46,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 02:45:46,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 02:45:46,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 02:45:46,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 02:45:46,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 02:45:46,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 02:45:46,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 02:45:46,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 02:45:46,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 02:45:46,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 02:45:46,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 02:45:46,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 02:45:46,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 02:45:46,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 02:45:46,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 02:45:46,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 02:45:46,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 02:45:46,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 02:45:46,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 02:45:46,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 02:45:46,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 02:45:46,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 02:45:46,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 02:45:46,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 02:45:46,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 02:45:46,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 02:45:46,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 02:45:46,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 02:45:46,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 02:45:46,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 02:45:46,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 02:45:46,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 02:45:46,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 02:45:46,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 02:45:46,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 02:45:46,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 02:45:46,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-15 02:45:46,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 02:45:46,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 02:45:46,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 02:45:46,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 02:45:46,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 02:45:46,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 02:45:46,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 02:45:46,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 02:45:46,908 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 02:45:46,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 02:45:46,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 02:45:46,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 02:45:46,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 02:45:46,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-15 02:45:46,911 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-11-15 02:45:47,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 02:45:47,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 02:45:47,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 02:45:47,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 02:45:47,112 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 02:45:47,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-11-15 02:45:47,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27d35ea4/349a530b73a44ef5af3e6a443be9eda5/FLAG2adeed915 [2022-11-15 02:45:47,590 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 02:45:47,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-11-15 02:45:47,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27d35ea4/349a530b73a44ef5af3e6a443be9eda5/FLAG2adeed915 [2022-11-15 02:45:47,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27d35ea4/349a530b73a44ef5af3e6a443be9eda5 [2022-11-15 02:45:47,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 02:45:47,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 02:45:47,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 02:45:47,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 02:45:47,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 02:45:47,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 02:45:47" (1/1) ... [2022-11-15 02:45:47,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7476cf67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:47, skipping insertion in model container [2022-11-15 02:45:47,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 02:45:47" (1/1) ... [2022-11-15 02:45:47,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 02:45:47,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 02:45:48,050 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-11-15 02:45:48,054 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-11-15 02:45:48,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 02:45:48,062 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 02:45:48,099 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-11-15 02:45:48,101 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-11-15 02:45:48,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 02:45:48,138 INFO L208 MainTranslator]: Completed translation [2022-11-15 02:45:48,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48 WrapperNode [2022-11-15 02:45:48,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 02:45:48,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 02:45:48,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 02:45:48,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 02:45:48,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,176 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-15 02:45:48,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 02:45:48,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 02:45:48,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 02:45:48,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 02:45:48,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,201 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 02:45:48,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 02:45:48,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 02:45:48,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 02:45:48,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (1/1) ... [2022-11-15 02:45:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 02:45:48,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:48,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:48,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-15 02:45:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-15 02:45:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-15 02:45:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-15 02:45:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-15 02:45:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 02:45:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 02:45:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 02:45:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 02:45:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-15 02:45:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 02:45:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 02:45:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 02:45:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 02:45:48,284 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 02:45:48,450 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 02:45:48,452 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 02:45:48,784 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 02:45:48,791 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 02:45:48,791 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-15 02:45:48,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 02:45:48 BoogieIcfgContainer [2022-11-15 02:45:48,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 02:45:48,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 02:45:48,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 02:45:48,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 02:45:48,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 02:45:47" (1/3) ... [2022-11-15 02:45:48,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31673510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 02:45:48, skipping insertion in model container [2022-11-15 02:45:48,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:45:48" (2/3) ... [2022-11-15 02:45:48,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31673510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 02:45:48, skipping insertion in model container [2022-11-15 02:45:48,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 02:45:48" (3/3) ... [2022-11-15 02:45:48,801 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-15 02:45:48,806 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 02:45:48,815 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 02:45:48,816 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-15 02:45:48,816 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 02:45:48,941 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-15 02:45:48,977 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:48,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:48,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:48,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:48,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-15 02:45:49,012 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-11-15 02:45:49,034 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-15 02:45:49,095 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,097 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/26) [2022-11-15 02:45:49,115 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,122 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) [2022-11-15 02:45:49,123 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 [2022-11-15 02:45:49,159 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-11-15 02:45:49,160 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-15 02:45:49,375 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,377 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/26) [2022-11-15 02:45:49,380 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,383 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) [2022-11-15 02:45:49,383 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 [2022-11-15 02:45:49,386 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,387 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,387 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,388 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,388 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (3/26) [2022-11-15 02:45:49,390 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,395 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) [2022-11-15 02:45:49,396 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 [2022-11-15 02:45:49,401 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,402 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,402 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,403 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,403 INFO L307 ceAbstractionStarter]: Result for error location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (4/26) [2022-11-15 02:45:49,405 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,410 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) [2022-11-15 02:45:49,411 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 [2022-11-15 02:45:49,417 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,418 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,419 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,419 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,420 INFO L307 ceAbstractionStarter]: Result for error location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (5/26) [2022-11-15 02:45:49,422 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,426 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) [2022-11-15 02:45:49,427 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 [2022-11-15 02:45:49,429 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,430 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,430 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,431 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,431 INFO L307 ceAbstractionStarter]: Result for error location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (6/26) [2022-11-15 02:45:49,434 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,440 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) [2022-11-15 02:45:49,441 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 [2022-11-15 02:45:49,443 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,444 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,444 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,445 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,445 INFO L307 ceAbstractionStarter]: Result for error location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (7/26) [2022-11-15 02:45:49,447 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-11-15 02:45:49,453 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,454 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,454 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,455 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,455 INFO L307 ceAbstractionStarter]: Result for error location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (8/26) [2022-11-15 02:45:49,460 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2022-11-15 02:45:49,468 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,469 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,469 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,469 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,470 INFO L307 ceAbstractionStarter]: Result for error location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (9/26) [2022-11-15 02:45:49,472 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2022-11-15 02:45:49,486 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,487 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,487 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,487 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,488 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,488 INFO L307 ceAbstractionStarter]: Result for error location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (10/26) [2022-11-15 02:45:49,490 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,503 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,503 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,504 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,504 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,504 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (11/26) [2022-11-15 02:45:49,509 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2022-11-15 02:45:49,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2022-11-15 02:45:49,529 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,530 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,530 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,531 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,531 INFO L307 ceAbstractionStarter]: Result for error location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (12/26) [2022-11-15 02:45:49,533 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,537 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2022-11-15 02:45:49,541 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,541 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,542 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,542 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,542 INFO L307 ceAbstractionStarter]: Result for error location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (13/26) [2022-11-15 02:45:49,545 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,547 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2022-11-15 02:45:49,551 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,552 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,552 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-15 02:45:49,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 02:45:49,552 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-15 02:45:49,552 INFO L307 ceAbstractionStarter]: Result for error location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW was SAFE (14/26) [2022-11-15 02:45:49,554 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 02:45:49,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 02:45:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:45:49,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 02:45:49,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2022-11-15 02:45:49,560 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 02:45:49,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW ======== [2022-11-15 02:45:49,561 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;@15d3e7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 02:45:49,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 02:45:49,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:45:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:45:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1093845670, now seen corresponding path program 1 times [2022-11-15 02:45:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:45:49,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089997210] [2022-11-15 02:45:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:45:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:45:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:45:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:45:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:45:49,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089997210] [2022-11-15 02:45:49,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089997210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 02:45:49,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 02:45:49,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 02:45:49,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004374452] [2022-11-15 02:45:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 02:45:49,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 02:45:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:45:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 02:45:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 02:45:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:49,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:45:49,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 02:45:49,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:49,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 02:45:49,974 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:45:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:45:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215175, now seen corresponding path program 1 times [2022-11-15 02:45:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:45:49,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126070769] [2022-11-15 02:45:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:45:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:45:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:45:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:45:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:45:57,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126070769] [2022-11-15 02:45:57,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126070769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 02:45:57,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 02:45:57,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-15 02:45:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140027468] [2022-11-15 02:45:57,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 02:45:57,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-15 02:45:57,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:45:57,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-15 02:45:57,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-15 02:45:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:57,097 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:45:57,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 02:45:57,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:45:57,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:00,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 02:46:00,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:46:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:46:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash -858914285, now seen corresponding path program 1 times [2022-11-15 02:46:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:46:00,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031594152] [2022-11-15 02:46:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:46:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:46:00,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031594152] [2022-11-15 02:46:00,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031594152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 02:46:00,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 02:46:00,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-15 02:46:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087710392] [2022-11-15 02:46:00,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 02:46:00,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-15 02:46:00,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:46:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-15 02:46:00,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-15 02:46:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:00,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:46:00,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 02:46:00,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:00,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:00,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:46:01,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-15 02:46:01,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:46:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:46:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash 678632843, now seen corresponding path program 1 times [2022-11-15 02:46:01,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:46:01,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949485434] [2022-11-15 02:46:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:46:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:03,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:46:03,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949485434] [2022-11-15 02:46:03,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949485434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:46:03,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794182764] [2022-11-15 02:46:03,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:03,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:46:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:46:03,510 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:46:03,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-15 02:46:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:03,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-15 02:46:03,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:46:03,746 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:46:03,747 INFO L350 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 11 treesize of output 11 [2022-11-15 02:46:03,901 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:46:03,945 INFO L350 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 23 treesize of output 22 [2022-11-15 02:46:04,237 INFO L350 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 25 treesize of output 25 [2022-11-15 02:46:04,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:04,540 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:46:04,541 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:46:04,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:04,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:04,705 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:46:04,996 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:46:05,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:05,104 INFO L350 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 25 treesize of output 25 [2022-11-15 02:46:05,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:05,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:05,307 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-15 02:46:05,307 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-15 02:46:05,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-15 02:46:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:05,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:46:05,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-15 02:46:05,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-15 02:46:07,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_130 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_130)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_133) .cse3 v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|)) (.cse0 (select .cse4 .cse3))) (or (< (+ .cse0 1) v_ArrVal_135) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) (+ 88 |c_~#queue~0.offset|)) 2147483647) (= 20 .cse0) (< (+ (select .cse4 .cse5) 1) v_ArrVal_133)))))) is different from false [2022-11-15 02:46:07,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_ArrVal_133 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_130 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_130)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_133) .cse1 v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|)) (.cse4 (select .cse2 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_133) (= .cse4 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse5 .cse1))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) .cse3) 2147483647) (< (+ .cse4 1) v_ArrVal_135)))))) is different from false [2022-11-15 02:46:08,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_ArrVal_129 (Array Int Int)) (v_ArrVal_133 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_130 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_129))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_130)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse3 .cse2)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_133) .cse2 v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_135) (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_133) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse5 .cse2))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) .cse4) 2147483647))))))) is different from false [2022-11-15 02:46:08,467 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_ArrVal_129 (Array Int Int)) (v_ArrVal_133 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_130 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_128 Int) (v_ArrVal_136 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_128)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_129))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_130)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_133) .cse3 v_ArrVal_135)) |c_~#stored_elements~0.base| v_ArrVal_136) |c_~#queue~0.base|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_133) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_137) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_135) (not (<= v_ArrVal_128 0)) (= .cse5 20))))))) is different from false [2022-11-15 02:46:08,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:08,486 INFO L350 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 283 treesize of output 183 [2022-11-15 02:46:08,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:08,509 INFO L350 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 349 treesize of output 343 [2022-11-15 02:46:08,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 151 [2022-11-15 02:46:08,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 167 [2022-11-15 02:46:08,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-15 02:46:08,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:08,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 175 [2022-11-15 02:46:09,342 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:46:09,342 INFO L350 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 25 treesize of output 38 [2022-11-15 02:46:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-15 02:46:09,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794182764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:46:09,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:46:09,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-15 02:46:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581693379] [2022-11-15 02:46:09,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:46:09,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-15 02:46:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:46:09,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-15 02:46:09,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=4882, Unknown=68, NotChecked=906, Total=6480 [2022-11-15 02:46:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:09,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:46:09,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 4.2875) internal successors, (343), 81 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 02:46:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:46:09,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:28,032 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 88 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:46:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:46:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 02:46:38,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-15 02:46:38,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:46:38,444 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:46:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:46:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash 119995393, now seen corresponding path program 1 times [2022-11-15 02:46:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:46:38,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498032228] [2022-11-15 02:46:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:46:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:46:41,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498032228] [2022-11-15 02:46:41,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498032228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:46:41,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612101483] [2022-11-15 02:46:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:46:41,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:46:41,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:46:41,415 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:46:41,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-15 02:46:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:46:41,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-15 02:46:41,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:46:41,681 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:46:41,681 INFO L350 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 11 treesize of output 11 [2022-11-15 02:46:41,856 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:46:41,915 INFO L350 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 23 treesize of output 22 [2022-11-15 02:46:42,170 INFO L350 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 16 treesize of output 18 [2022-11-15 02:46:42,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:42,454 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:46:42,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-15 02:46:42,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:42,525 INFO L350 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 23 treesize of output 22 [2022-11-15 02:46:42,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-15 02:46:42,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:42,788 INFO L350 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 16 treesize of output 18 [2022-11-15 02:46:42,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:46:42,965 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 02:46:42,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-15 02:46:43,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:46:43,017 INFO L350 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 20 [2022-11-15 02:46:43,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-15 02:46:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:46:43,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:46:43,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 20))))) is different from false [2022-11-15 02:46:43,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 20))))) is different from false [2022-11-15 02:46:43,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 20))))) is different from false [2022-11-15 02:46:43,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_218 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_218) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:46:43,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_217)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_218) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 20))))) is different from false [2022-11-15 02:46:43,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_217))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_218) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 20))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| (select .cse4 .cse3)))))) is different from false [2022-11-15 02:46:45,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_215 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_215))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) v_ArrVal_217))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_218) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| (select .cse2 .cse1)))))))) is different from false [2022-11-15 02:46:45,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 Int) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_223 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| Int) (v_ArrVal_218 Int) (v_ArrVal_217 Int) (v_ArrVal_222 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_213)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_215))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25|) |c_~#queue~0.offset|) v_ArrVal_217))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_218) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_222) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_25| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22|) |c_~#queue~0.offset|) v_ArrVal_223) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_22| (select .cse2 .cse1)))))))) is different from false [2022-11-15 02:46:45,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:45,315 INFO L350 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 244 treesize of output 159 [2022-11-15 02:46:45,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:45,325 INFO L350 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 275 treesize of output 273 [2022-11-15 02:46:45,329 INFO L350 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 269 treesize of output 257 [2022-11-15 02:46:45,334 INFO L350 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 257 treesize of output 241 [2022-11-15 02:46:45,347 INFO L350 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 8 treesize of output 4 [2022-11-15 02:46:45,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:46:45,490 INFO L350 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 119 treesize of output 111 [2022-11-15 02:46:45,806 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:46:45,806 INFO L350 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 25 treesize of output 38 [2022-11-15 02:46:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-15 02:46:45,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612101483] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:46:45,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:46:45,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 23, 25] total 80 [2022-11-15 02:46:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279101435] [2022-11-15 02:46:45,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:46:45,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-15 02:46:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:46:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-15 02:46:45,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4640, Unknown=22, NotChecked=1176, Total=6320 [2022-11-15 02:46:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:45,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:46:45,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 5.2625) internal successors, (421), 80 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 02:46:45,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:46:45,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:46:45,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:46:45,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 02:46:45,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:47:02,593 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 79 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:47:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:47:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:47:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:47:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-15 02:47:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:47:16,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-15 02:47:17,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:47:17,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:47:17,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:47:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1525993803, now seen corresponding path program 2 times [2022-11-15 02:47:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:47:17,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436424600] [2022-11-15 02:47:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:47:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:47:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:47:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:47:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:47:22,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436424600] [2022-11-15 02:47:22,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436424600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:47:22,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321089574] [2022-11-15 02:47:22,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 02:47:22,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:47:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:47:22,818 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:47:22,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-15 02:47:22,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 02:47:22,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 02:47:22,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-15 02:47:22,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:47:23,089 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:47:23,090 INFO L350 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 11 treesize of output 11 [2022-11-15 02:47:23,299 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:47:23,368 INFO L350 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 23 treesize of output 22 [2022-11-15 02:47:23,679 INFO L350 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 25 treesize of output 25 [2022-11-15 02:47:24,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:24,075 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:47:24,076 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:47:24,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:24,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:24,292 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:47:24,644 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:47:24,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:24,754 INFO L350 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 25 treesize of output 25 [2022-11-15 02:47:25,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:25,097 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:47:25,097 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:47:25,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:25,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:25,322 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:47:25,675 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:47:25,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:25,792 INFO L350 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 25 treesize of output 25 [2022-11-15 02:47:26,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:26,142 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-15 02:47:26,142 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-15 02:47:26,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:26,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:26,350 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:47:26,653 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-15 02:47:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:26,752 INFO L350 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 25 treesize of output 25 [2022-11-15 02:47:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:47:26,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:47:26,969 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-15 02:47:26,969 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-15 02:47:27,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-15 02:47:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:47:27,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:47:27,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-15 02:47:27,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_338))))) is different from false [2022-11-15 02:47:27,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_338) (not (<= v_ArrVal_337 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-15 02:47:27,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_337) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_338))))) is different from false [2022-11-15 02:47:27,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_335)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_337) .cse3 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_337) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-15 02:47:28,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_335)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_337) .cse4 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_337) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse3 .cse4))) (< (+ (select .cse1 .cse4) 1) v_ArrVal_338)))))) is different from false [2022-11-15 02:47:37,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_337) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (not (<= v_ArrVal_331 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse4 .cse1))))))))) is different from false [2022-11-15 02:47:37,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_337) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_331) (< (+ (select .cse2 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse6 .cse1)))))))))) is different from false [2022-11-15 02:47:39,969 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_337) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (< (+ .cse0 1) v_ArrVal_331) (< (+ (select .cse3 .cse2) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse5 .cse2)))))))))))) is different from false [2022-11-15 02:47:40,057 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_329) .cse8 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse1 .cse2))) (< (+ .cse0 1) v_ArrVal_331) (< (+ (select .cse3 .cse2) 1) v_ArrVal_338) (< (+ (select .cse3 .cse4) 1) v_ArrVal_337) (not (<= v_ArrVal_329 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse5 .cse2))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647)))))))))) is different from false [2022-11-15 02:47:40,327 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse9))) (or (= .cse0 20) (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_329) .cse9 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse1 .cse2))) (< (+ .cse0 1) v_ArrVal_331) (< (+ (select .cse3 .cse2) 1) v_ArrVal_338) (< (+ (select .cse3 .cse4) 1) v_ArrVal_337) (< (+ (select .cse5 .cse6) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse7 .cse2))) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647))))))))))) is different from false [2022-11-15 02:47:40,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_327)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_329) .cse8 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse7 (select .cse4 .cse8))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_329) (< (+ (select .cse6 .cse3) 1) v_ArrVal_337) (= .cse7 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (< (+ .cse7 1) v_ArrVal_331) (< (+ (select .cse6 .cse1) 1) v_ArrVal_338)))))))) is different from false [2022-11-15 02:47:40,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_335 Int) (v_ArrVal_331 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_341 Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int)) (let ((.cse5 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_327)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_329) .cse8 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse8))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_338) (< (+ .cse2 1) v_ArrVal_331) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_337) (< (+ (select .cse5 .cse6) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse7 .cse1))) (= .cse2 20)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse10 .cse8)))))) is different from false [2022-11-15 02:47:40,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_329) .cse7 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_337) .cse3 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse5 (select .cse0 .cse7))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse3))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (< (+ .cse5 1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse6 .cse7))) (= .cse5 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse8 .cse3))) (< (+ (select .cse9 .cse4) 1) v_ArrVal_337) (< (+ (select .cse9 .cse3) 1) v_ArrVal_338))))))))) is different from false [2022-11-15 02:47:52,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse7 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_337) (< (+ (select .cse4 .cse3) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse6 .cse1))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (not (<= v_ArrVal_325 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (= .cse7 20) (< (+ .cse7 1) v_ArrVal_331)))))))))) is different from false [2022-11-15 02:47:53,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse7 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_325) (< (+ (select .cse2 .cse3) 1) v_ArrVal_337) (< (+ (select .cse4 .cse3) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse6 .cse1))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (= .cse7 20) (< (+ .cse7 1) v_ArrVal_331)))))))))) is different from false [2022-11-15 02:47:53,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse9 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_337) (< (+ (select .cse4 .cse3) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_325) (< (+ (select .cse2 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse8 .cse1))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (= .cse9 20) (< (+ .cse9 1) v_ArrVal_331))))))))))) is different from false [2022-11-15 02:47:53,325 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse9 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_337) (< (+ (select .cse4 .cse3) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_325) (< (+ (select .cse2 .cse1) 1) v_ArrVal_338) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse8 .cse1))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (= .cse9 20) (< (+ .cse9 1) v_ArrVal_331))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-15 02:47:57,097 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse12))) (or (= .cse0 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_323) .cse12 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse1 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_329) .cse2 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse2))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse2))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (= 20 .cse5) (< (+ (select .cse6 .cse4) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse7 .cse2))) (< (+ .cse0 1) v_ArrVal_325) (not (<= v_ArrVal_323 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ .cse5 1) v_ArrVal_331) (< (+ (select .cse8 .cse2) 1) v_ArrVal_338) (< (+ (select .cse8 .cse4) 1) v_ArrVal_337))))))))))))) is different from false [2022-11-15 02:47:57,589 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse5 .cse13))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_323) .cse13 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse2 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse4 (select .cse7 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse3) 2147483647) (= 20 .cse4) (< (+ (select .cse5 .cse6) 1) v_ArrVal_323) (< (+ (select .cse7 .cse3) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse8 .cse1))) (< (+ .cse9 1) v_ArrVal_325) (< (+ .cse4 1) v_ArrVal_331) (< (+ (select .cse10 .cse1) 1) v_ArrVal_338) (< (+ (select .cse10 .cse3) 1) v_ArrVal_337))))))))))) (= .cse9 20)))) is different from false [2022-11-15 02:47:57,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_320)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_323) .cse11 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse9 (select .cse13 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse6 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse0 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse5 (select .cse10 .cse1)) (.cse7 (select .cse3 .cse11))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_323) (< (+ .cse5 1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse6 .cse1))) (= .cse7 20) (= 20 .cse5) (< (+ (select .cse8 .cse1) 1) v_ArrVal_338) (< (+ (select .cse8 .cse2) 1) v_ArrVal_337) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse9 .cse1))) (< (+ .cse7 1) v_ArrVal_325) (< (+ (select .cse10 .cse2) 1) v_ArrVal_329))))))))))) is different from false [2022-11-15 02:47:57,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int)) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse6 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_320)) (.cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_323) .cse11 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_329) .cse2 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse3 (select .cse9 .cse2)) (.cse8 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse0 (select .cse6 .cse11))) (or (< (+ .cse0 1) v_ArrVal_325) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse1 .cse2))) (< (+ .cse3 1) v_ArrVal_331) (< (+ (select .cse4 .cse5) 1) v_ArrVal_337) (< (+ (select .cse4 .cse2) 1) v_ArrVal_338) (= .cse3 20) (< (+ (select .cse6 .cse7) 1) v_ArrVal_323) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse8 .cse2))) (< (+ (select .cse9 .cse5) 1) v_ArrVal_329) (= .cse0 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse10 .cse2))))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse14 .cse11)))))) is different from false [2022-11-15 02:47:58,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_320)) (.cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 .cse9 v_ArrVal_323) .cse12 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse2 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_329) .cse1 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse3 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_337) .cse1 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse10 (select .cse6 .cse1)) (.cse5 (select .cse8 .cse12))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse4) 2147483647) (= .cse5 20) (< (+ (select .cse6 .cse4) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_338) (< (+ (select .cse8 .cse9) 1) v_ArrVal_323) (< (+ .cse10 1) v_ArrVal_331) (= .cse10 20) (< (+ (select .cse7 .cse4) 1) v_ArrVal_337) (< (+ .cse5 1) v_ArrVal_325) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse11 .cse12)))))))))))))) is different from false [2022-11-15 02:47:58,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) v_ArrVal_320)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_323) .cse3 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_329) .cse3 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse0 (select .cse7 .cse3)) (.cse1 (select .cse5 .cse3)) (.cse4 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_337) .cse3 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ 1 .cse0) v_ArrVal_331) (= 20 .cse0) (< (+ .cse1 1) v_ArrVal_325) (= 20 .cse1) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_323) (< (+ (select .cse7 .cse6) 1) v_ArrVal_329) (< (+ (select .cse8 .cse3) 1) v_ArrVal_338) (< (+ (select .cse8 .cse6) 1) v_ArrVal_337) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse9 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse10 .cse3)))))))))))))) is different from false [2022-11-15 02:47:59,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_319))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) v_ArrVal_320)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_323) .cse3 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_329) .cse3 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse7 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_337) .cse3 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|)) (.cse1 (select .cse9 .cse3)) (.cse0 (select .cse5 .cse3))) (or (< (+ .cse0 1) v_ArrVal_325) (< (+ 1 .cse1) v_ArrVal_331) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_338) (< (+ 1 (select .cse5 .cse6)) v_ArrVal_323) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse7 .cse3))) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse8 .cse3))) (= 20 .cse1) (< (+ (select .cse9 .cse6) 1) v_ArrVal_329) (< (+ (select .cse4 .cse6) 1) v_ArrVal_337) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse10 .cse3))) (= .cse0 20))))))))))))) is different from false [2022-11-15 02:48:01,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_327 Int) (v_ArrVal_338 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (v_ArrVal_326 (Array Int Int)) (v_ArrVal_335 Int) (v_ArrVal_323 Int) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_318)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_319))) (let ((.cse9 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) v_ArrVal_320)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_323) .cse2 v_ArrVal_325)) |c_~#stored_elements~0.base| v_ArrVal_326))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_327))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_329) .cse2 v_ArrVal_331)) |c_~#stored_elements~0.base| v_ArrVal_333))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_335))) (let ((.cse0 (select .cse5 .cse2)) (.cse4 (select .cse8 .cse2)) (.cse1 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_337) .cse2 v_ArrVal_338)) |c_~#stored_elements~0.base| v_ArrVal_340) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_325) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_338) (< (+ .cse4 1) v_ArrVal_331) (< (+ (select .cse5 .cse6) 1) v_ArrVal_323) (< (+ (select .cse3 .cse6) 1) v_ArrVal_337) (not (<= v_ArrVal_318 0)) (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| (select .cse7 .cse2))) (= .cse4 20) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_341) .cse6) 2147483647) (< (+ (select .cse8 .cse6) 1) v_ArrVal_329) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| (select .cse9 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse10 .cse2))))))))))))))) is different from false [2022-11-15 02:48:01,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:48:01,054 INFO L350 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 1592 treesize of output 1012 [2022-11-15 02:48:01,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:48:01,095 INFO L350 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 2170 [2022-11-15 02:48:01,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 781 treesize of output 765 [2022-11-15 02:48:01,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 893 treesize of output 829 [2022-11-15 02:48:01,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1331 treesize of output 1283 [2022-11-15 02:48:01,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1555 treesize of output 1523 [2022-11-15 02:48:01,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:48:01,307 INFO L350 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 17 treesize of output 9 [2022-11-15 02:48:03,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:48:03,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 378 treesize of output 390 [2022-11-15 02:48:04,553 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:48:04,553 INFO L350 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 25 treesize of output 38 [2022-11-15 02:48:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 39 refuted. 10 times theorem prover too weak. 0 trivial. 122 not checked. [2022-11-15 02:48:04,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321089574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:48:04,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:48:04,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 53] total 141 [2022-11-15 02:48:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045719850] [2022-11-15 02:48:04,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:48:04,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2022-11-15 02:48:04,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:48:04,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2022-11-15 02:48:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=11517, Unknown=164, NotChecked=6578, Total=20022 [2022-11-15 02:48:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:48:04,603 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:48:04,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 141 states have (on average 4.177304964539007) internal successors, (589), 142 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 02:48:04,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:48:04,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:48:04,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:48:04,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-15 02:48:04,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-15 02:48:04,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:48:42,781 WARN L233 SmtUtils]: Spent 16.42s on a formula simplification. DAG size of input: 160 DAG size of output: 157 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:49:14,361 WARN L233 SmtUtils]: Spent 15.82s on a formula simplification. DAG size of input: 158 DAG size of output: 155 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:49:42,325 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 155 DAG size of output: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:50:26,870 WARN L233 SmtUtils]: Spent 19.61s on a formula simplification. DAG size of input: 158 DAG size of output: 155 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:51:39,739 WARN L233 SmtUtils]: Spent 35.88s on a formula simplification. DAG size of input: 157 DAG size of output: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:51:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:51:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:51:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:51:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-15 02:51:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 02:51:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-15 02:51:39,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-15 02:51:40,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:51:40,004 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-15 02:51:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 02:51:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1624944705, now seen corresponding path program 2 times [2022-11-15 02:51:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 02:51:40,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754002540] [2022-11-15 02:51:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 02:51:40,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 02:51:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 02:51:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 18 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:51:46,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 02:51:46,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754002540] [2022-11-15 02:51:46,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754002540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 02:51:46,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028482863] [2022-11-15 02:51:46,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 02:51:46,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 02:51:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 02:51:46,231 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 02:51:46,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-15 02:51:46,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 02:51:46,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 02:51:46,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-15 02:51:46,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 02:51:46,524 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 02:51:46,525 INFO L350 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 11 treesize of output 11 [2022-11-15 02:51:46,697 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-15 02:51:46,766 INFO L350 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 23 treesize of output 22 [2022-11-15 02:51:47,020 INFO L350 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 16 treesize of output 18 [2022-11-15 02:51:47,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:51:47,330 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:51:47,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-15 02:51:47,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:51:47,386 INFO L350 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 23 treesize of output 22 [2022-11-15 02:51:47,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-15 02:51:47,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:51:47,677 INFO L350 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 16 treesize of output 18 [2022-11-15 02:51:47,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:51:47,979 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:51:47,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-15 02:51:48,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:51:48,044 INFO L350 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 23 treesize of output 22 [2022-11-15 02:51:48,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-15 02:51:48,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:51:48,365 INFO L350 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 16 treesize of output 18 [2022-11-15 02:51:48,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:51:48,665 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 02:51:48,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-15 02:51:48,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:51:48,747 INFO L350 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 23 treesize of output 22 [2022-11-15 02:51:48,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-15 02:51:49,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:51:49,090 INFO L350 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 16 treesize of output 18 [2022-11-15 02:51:49,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 02:51:49,340 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 02:51:49,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-15 02:51:49,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 02:51:49,410 INFO L350 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 23 treesize of output 22 [2022-11-15 02:51:49,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-15 02:51:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 02:51:49,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 02:51:50,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20))))) is different from false [2022-11-15 02:51:50,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:51:50,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_468) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:51:50,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_466)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_468) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1)))))) is different from false [2022-11-15 02:51:50,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_466))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_468) .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse4 .cse3)))))) is different from false [2022-11-15 02:51:50,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_468 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_468) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse3))))))) is different from false [2022-11-15 02:51:50,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_468) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse1))) (not (= 20 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1)))))))) is different from false [2022-11-15 02:51:50,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_468) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20))))))) is different from false [2022-11-15 02:51:50,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_461) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_468) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20))))))) is different from false [2022-11-15 02:51:50,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_459)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_461) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_468) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20))))))) is different from false [2022-11-15 02:51:50,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse0 .cse1))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_459))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_461) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_468) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse3))) (not (= 20 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse4 .cse3))))))))))) is different from false [2022-11-15 02:51:51,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_461) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_468) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse4 .cse3))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse3) 20)))))))) is different from false [2022-11-15 02:51:52,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse8 .cse6 v_ArrVal_461) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse5 .cse6 v_ArrVal_468) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse3 .cse1)))))))))) is different from false [2022-11-15 02:51:52,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_455) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse8 .cse6 v_ArrVal_461) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse5 .cse6 v_ArrVal_468) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse3 .cse1)))))))))) is different from false [2022-11-15 02:51:52,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_453)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_455) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse8 .cse6 v_ArrVal_461) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse5 .cse6 v_ArrVal_468) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse3 .cse1)))))))))) is different from false [2022-11-15 02:51:52,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_453))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_455) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse8 .cse6 v_ArrVal_461) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse5 .cse6 v_ArrVal_468) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse3 .cse1))) (not (= 20 (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1)))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse11 .cse10)))))) is different from false [2022-11-15 02:51:52,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_453))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_455) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse10 .cse8 v_ArrVal_461) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse7 .cse8 v_ArrVal_468) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse5 .cse3))) (not (= (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse3) 20)))))))))) is different from false [2022-11-15 02:51:53,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_453))) (store (store .cse11 .cse7 v_ArrVal_455) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse9 .cse7 v_ArrVal_461) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 .cse7 v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse4 .cse1)))))))))))) is different from false [2022-11-15 02:51:53,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int) (v_ArrVal_458 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_466 Int) (v_ArrVal_453 Int) (v_ArrVal_474 Int) (v_ArrVal_450 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_453))) (store (store .cse11 .cse7 v_ArrVal_455) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse9 .cse7 v_ArrVal_461) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 .cse7 v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse4 .cse1)))))))))))) is different from false [2022-11-15 02:51:53,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:51:53,620 INFO L350 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 2504 treesize of output 1519 [2022-11-15 02:51:53,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:51:53,644 INFO L350 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 2079 treesize of output 2053 [2022-11-15 02:51:53,664 INFO L350 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 1967 treesize of output 1947 [2022-11-15 02:51:53,680 INFO L350 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 1675 treesize of output 1611 [2022-11-15 02:51:53,695 INFO L350 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 1980 treesize of output 1932 [2022-11-15 02:51:53,711 INFO L350 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 2079 treesize of output 2047 [2022-11-15 02:51:53,740 INFO L350 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 8 treesize of output 4 [2022-11-15 02:51:54,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 02:51:54,441 INFO L350 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 484 treesize of output 468 [2022-11-15 02:51:55,210 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-15 02:51:55,211 INFO L350 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 25 treesize of output 38 [2022-11-15 02:51:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 59 refuted. 10 times theorem prover too weak. 0 trivial. 120 not checked. [2022-11-15 02:51:55,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028482863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 02:51:55,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 02:51:55,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 35, 43] total 122 [2022-11-15 02:51:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641728463] [2022-11-15 02:51:55,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 02:51:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-11-15 02:51:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 02:51:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-11-15 02:51:55,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1102, Invalid=9409, Unknown=71, NotChecked=4180, Total=14762 [2022-11-15 02:51:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:51:55,260 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 02:51:55,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 5.467213114754099) internal successors, (667), 122 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 02:51:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:51:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 02:51:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-15 02:51:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-15 02:51:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 02:51:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-15 02:51:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 02:52:57,524 WARN L233 SmtUtils]: Spent 22.21s on a formula simplification. DAG size of input: 154 DAG size of output: 149 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:53:40,182 WARN L233 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 159 DAG size of output: 156 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:54:24,685 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 156 DAG size of output: 153 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:55:36,447 WARN L233 SmtUtils]: Spent 40.97s on a formula simplification. DAG size of input: 170 DAG size of output: 164 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:56:27,353 WARN L233 SmtUtils]: Spent 14.92s on a formula simplification. DAG size of input: 162 DAG size of output: 156 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:56:52,480 WARN L233 SmtUtils]: Spent 8.89s on a formula simplification. DAG size of input: 133 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:56:52,486 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1)))))) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_466 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_474 Int) (v_ArrVal_461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_468 Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_458))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_459))) (store (store .cse9 .cse7 v_ArrVal_461) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse6 .cse7 v_ArrVal_468) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| (select .cse4 .cse1)))))))))) (forall ((v_ArrVal_466 Int) (v_ArrVal_474 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_472 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_465))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_466))) (store (store .cse13 .cse7 v_ArrVal_468) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| (select .cse10 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse11 .cse1))) (not (= 20 (select (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_474) .cse1)))))))))) is different from false [2022-11-15 02:57:23,671 WARN L233 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 170 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:57:54,603 WARN L233 SmtUtils]: Spent 9.44s on a formula simplification. DAG size of input: 180 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:58:32,202 WARN L233 SmtUtils]: Spent 10.77s on a formula simplification. DAG size of input: 192 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 02:59:12,403 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 202 DAG size of output: 130 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-11-15 03:00:00,003 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 [2022-11-15 03:00:00,003 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 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 [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 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 [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 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 [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 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 [2022-11-15 03:00:00,004 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 [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,003 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,004 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:00,003 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 03:00:01,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Ended with exit code 0 [2022-11-15 03:00:01,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-15 03:00:01,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Forceful destruction successful, exit code 0 [2022-11-15 03:00:01,224 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-15 03:00:01,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-15 03:00:01,265 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-11-15 03:00:01,266 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 1 remaining) [2022-11-15 03:00:01,267 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-11-15 03:00:01,267 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW was TIMEOUT (15/26) [2022-11-15 03:00:01,270 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 03:00:01,270 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 03:00:01,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-11-15 03:00:01,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 03:00:01 BasicIcfg [2022-11-15 03:00:01,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 03:00:01,279 INFO L158 Benchmark]: Toolchain (without parser) took 853655.23ms. Allocated memory was 182.5MB in the beginning and 829.4MB in the end (delta: 647.0MB). Free memory was 124.7MB in the beginning and 613.5MB in the end (delta: -488.8MB). Peak memory consumption was 159.2MB. Max. memory is 8.0GB. [2022-11-15 03:00:01,279 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 03:00:01,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.07ms. Allocated memory is still 182.5MB. Free memory was 124.6MB in the beginning and 135.4MB in the end (delta: -10.8MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-11-15 03:00:01,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.96ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 132.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-15 03:00:01,279 INFO L158 Benchmark]: Boogie Preprocessor took 43.32ms. Allocated memory is still 182.5MB. Free memory was 132.3MB in the beginning and 130.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 03:00:01,279 INFO L158 Benchmark]: RCFGBuilder took 571.85ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 108.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-11-15 03:00:01,279 INFO L158 Benchmark]: TraceAbstraction took 852483.82ms. Allocated memory was 182.5MB in the beginning and 829.4MB in the end (delta: 647.0MB). Free memory was 107.2MB in the beginning and 613.5MB in the end (delta: -506.3MB). Peak memory consumption was 141.2MB. Max. memory is 8.0GB. [2022-11-15 03:00:01,280 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.07ms. Allocated memory is still 182.5MB. Free memory was 124.6MB in the beginning and 135.4MB in the end (delta: -10.8MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.96ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 132.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.32ms. Allocated memory is still 182.5MB. Free memory was 132.3MB in the beginning and 130.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 571.85ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 108.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 852483.82ms. Allocated memory was 182.5MB in the beginning and 829.4MB in the end (delta: 647.0MB). Free memory was 107.2MB in the beginning and 613.5MB in the end (delta: -506.3MB). Peak memory consumption was 141.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.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: 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] , 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, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 69, Number of trivial persistent sets: 69, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.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: 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] , 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, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1221, independent: 1220, independent conditional: 0, independent unconditional: 1220, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1198, independent: 1197, independent conditional: 0, independent unconditional: 1197, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1221, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1198, unknown conditional: 0, unknown unconditional: 1198] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1197, Positive conditional cache size: 0, Positive unconditional cache size: 1197, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 75, Number of trivial persistent sets: 69, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1223, independent: 1220, independent conditional: 6, independent unconditional: 1214, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1221, independent: 1220, independent conditional: 0, independent unconditional: 1220, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1198, independent: 1197, independent conditional: 0, independent unconditional: 1197, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1221, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1198, unknown conditional: 0, unknown unconditional: 1198] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1197, Positive conditional cache size: 0, Positive unconditional cache size: 1197, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: 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: 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: 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] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3230, independent: 3226, independent conditional: 27, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3227, independent: 3223, independent conditional: 24, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5450, independent: 5430, independent conditional: 63, independent unconditional: 5367, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 6550, Positive cache size: 6537, Positive conditional cache size: 0, Positive unconditional cache size: 6537, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6259, independent: 6238, independent conditional: 68, independent unconditional: 6170, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 7932, Positive cache size: 7915, Positive conditional cache size: 0, Positive unconditional cache size: 7915, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6422, independent: 6396, independent conditional: 104, independent unconditional: 6292, dependent: 26, dependent conditional: 7, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 26, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6304, independent: 6278, independent conditional: 153, independent unconditional: 6125, dependent: 26, dependent conditional: 9, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 35, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6512, independent: 6482, independent conditional: 190, independent unconditional: 6292, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 46, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6337, independent: 6310, independent conditional: 185, independent unconditional: 6125, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 56, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 88, Number of trivial persistent sets: 66, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3230, independent: 3226, independent conditional: 27, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 86, Number of trivial persistent sets: 64, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3227, independent: 3223, independent conditional: 24, independent unconditional: 3199, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 3046, Positive conditional cache size: 0, Positive unconditional cache size: 3046, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 105, Number of trivial persistent sets: 70, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 5450, independent: 5430, independent conditional: 63, independent unconditional: 5367, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 6550, Positive cache size: 6537, Positive conditional cache size: 0, Positive unconditional cache size: 6537, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 111, Number of trivial persistent sets: 71, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6259, independent: 6238, independent conditional: 68, independent unconditional: 6170, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 7932, Positive cache size: 7915, Positive conditional cache size: 0, Positive unconditional cache size: 7915, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 113, Number of trivial persistent sets: 73, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6422, independent: 6396, independent conditional: 104, independent unconditional: 6292, dependent: 26, dependent conditional: 7, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 26, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 111, Number of trivial persistent sets: 72, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6304, independent: 6278, independent conditional: 153, independent unconditional: 6125, dependent: 26, dependent conditional: 9, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 35, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 113, Number of trivial persistent sets: 73, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6512, independent: 6482, independent conditional: 190, independent unconditional: 6292, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 46, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 111, Number of trivial persistent sets: 72, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6337, independent: 6310, independent conditional: 185, independent unconditional: 6125, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43741, independent: 43583, independent conditional: 814, independent unconditional: 42769, dependent: 158, dependent conditional: 56, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43685, independent: 43583, independent conditional: 0, independent unconditional: 43583, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9010, independent: 8989, independent conditional: 0, independent unconditional: 8989, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43685, independent: 34594, independent conditional: 0, independent unconditional: 34594, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 9010, unknown conditional: 0, unknown unconditional: 9010] , Statistics on independence cache: Total cache size (in pairs): 9010, Positive cache size: 8989, Positive conditional cache size: 0, Positive unconditional cache size: 8989, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 56, Statistics for Abstraction: - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - PositiveResult [Line: 981]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 988]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 988]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1011]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1011]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1029]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1029]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 996]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 996]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1002]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1002]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, 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, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.2s, 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: t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW with 2 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 851.7s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 764.7s, 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: 252, 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.4s SatisfiabilityAnalysisTime, 85.5s InterpolantComputationTime, 1779 NumberOfCodeBlocks, 1779 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2506 ConstructedInterpolants, 540 QuantifiedInterpolants, 230059 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1644 ConjunctsInSsa, 381 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 320/1630 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: t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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: t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW with 1 thread instances CFG has 5 procedures, 392 locations, 26 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