./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:46:18,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:46:18,964 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2023-12-02 20:46:18,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:46:18,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:46:18,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:46:18,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:46:18,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:46:18,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:46:18,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:46:18,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:46:18,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:46:18,995 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:46:18,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:46:18,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:46:18,997 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:46:18,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:46:18,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:46:18,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:46:18,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:46:18,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:46:19,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:46:19,001 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 20:46:19,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:46:19,002 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:46:19,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:46:19,003 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:46:19,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:46:19,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:46:19,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:46:19,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:46:19,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:46:19,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:46:19,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:46:19,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:46:19,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:46:19,006 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:46:19,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:46:19,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:46:19,006 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:46:19,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:46:19,007 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:46:19,007 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:46:19,007 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:46:19,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-12-02 20:46:19,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:46:19,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:46:19,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:46:19,228 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:46:19,229 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:46:19,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:46:21,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:46:22,247 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:46:22,247 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-12-02 20:46:22,265 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/data/ecb49a3a8/0e70aa17fd8247558a10a4f783917151/FLAG1ef5ce71a [2023-12-02 20:46:22,279 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/data/ecb49a3a8/0e70aa17fd8247558a10a4f783917151 [2023-12-02 20:46:22,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:46:22,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:46:22,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:46:22,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:46:22,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:46:22,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fe8d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22, skipping insertion in model container [2023-12-02 20:46:22,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,348 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:46:22,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:46:22,754 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:46:22,807 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:46:22,865 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:46:22,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22 WrapperNode [2023-12-02 20:46:22,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:46:22,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:46:22,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:46:22,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:46:22,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,925 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 226 [2023-12-02 20:46:22,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:46:22,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:46:22,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:46:22,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:46:22,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:46:22,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:46:22,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:46:22,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:46:22,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (1/1) ... [2023-12-02 20:46:22,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:46:22,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:22,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:46:23,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:46:23,044 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 20:46:23,044 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 20:46:23,044 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 20:46:23,045 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 20:46:23,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:46:23,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:46:23,045 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:46:23,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:46:23,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:46:23,045 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:46:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:46:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:46:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:46:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:46:23,048 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:46:23,192 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:46:23,193 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:46:23,521 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:46:23,746 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:46:23,746 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:46:23,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:46:23 BoogieIcfgContainer [2023-12-02 20:46:23,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:46:23,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:46:23,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:46:23,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:46:23,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:46:22" (1/3) ... [2023-12-02 20:46:23,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfd5d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:46:23, skipping insertion in model container [2023-12-02 20:46:23,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:22" (2/3) ... [2023-12-02 20:46:23,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfd5d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:46:23, skipping insertion in model container [2023-12-02 20:46:23,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:46:23" (3/3) ... [2023-12-02 20:46:23,754 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-12-02 20:46:23,762 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:46:23,770 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:46:23,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-12-02 20:46:23,770 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:46:23,832 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 20:46:23,877 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:23,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:46:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:23,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:46:23,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:46:23,926 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:46:23,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-12-02 20:46:23,946 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=LoopHeads, 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;@2446892b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:23,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 20:46:24,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:24,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash -559619901, now seen corresponding path program 1 times [2023-12-02 20:46:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:24,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711333294] [2023-12-02 20:46:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:24,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711333294] [2023-12-02 20:46:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711333294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:24,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:46:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469672381] [2023-12-02 20:46:24,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:24,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:46:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:24,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:46:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:46:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:24,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:24,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:24,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:24,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:46:24,717 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:24,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1218594584, now seen corresponding path program 1 times [2023-12-02 20:46:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437981686] [2023-12-02 20:46:24,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:24,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437981686] [2023-12-02 20:46:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437981686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:25,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:25,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 20:46:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920986961] [2023-12-02 20:46:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:46:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:46:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:46:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:25,159 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:25,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:25,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:25,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:26,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:46:26,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:26,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2087028611, now seen corresponding path program 1 times [2023-12-02 20:46:26,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:26,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99876938] [2023-12-02 20:46:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99876938] [2023-12-02 20:46:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99876938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:26,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:46:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90347792] [2023-12-02 20:46:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:26,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:46:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:46:26,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:46:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:26,965 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:26,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:26,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:26,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:26,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:31,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:46:31,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:31,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash -273376852, now seen corresponding path program 1 times [2023-12-02 20:46:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:31,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620764081] [2023-12-02 20:46:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620764081] [2023-12-02 20:46:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620764081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:32,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:32,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:46:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110119464] [2023-12-02 20:46:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:32,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:46:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:46:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:46:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:32,188 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:32,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:32,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:32,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:32,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:32,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:32,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:32,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:32,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:32,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 20:46:32,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:32,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -722129008, now seen corresponding path program 1 times [2023-12-02 20:46:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833579148] [2023-12-02 20:46:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833579148] [2023-12-02 20:46:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833579148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:46:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859266643] [2023-12-02 20:46:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:32,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:46:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:46:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:46:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:32,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:32,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:32,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:32,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:32,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:32,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:32,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:38,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 20:46:38,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:38,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash 546556225, now seen corresponding path program 1 times [2023-12-02 20:46:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502290692] [2023-12-02 20:46:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502290692] [2023-12-02 20:46:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502290692] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354518336] [2023-12-02 20:46:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:39,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:39,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:39,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:39,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:46:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:39,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 20:46:39,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:39,673 INFO L378 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 15 treesize of output 1 [2023-12-02 20:46:39,757 INFO L378 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 13 [2023-12-02 20:46:39,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:39,802 INFO L378 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 18 treesize of output 13 [2023-12-02 20:46:39,870 INFO L378 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 26 treesize of output 20 [2023-12-02 20:46:39,875 INFO L378 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 30 treesize of output 22 [2023-12-02 20:46:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:39,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:40,089 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_169 Int) (v_ArrVal_166 Int) (v_ArrVal_168 (Array Int Int))) (or (< 0 (+ 2147483650 (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_166)) |c_~#stored_elements~0.base| v_ArrVal_168) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_169)) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_169 2147483648) 0))) is different from false [2023-12-02 20:46:40,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:40,135 INFO L378 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 60 treesize of output 51 [2023-12-02 20:46:40,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:40,152 INFO L378 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 65 treesize of output 67 [2023-12-02 20:46:40,160 INFO L378 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 36 treesize of output 24 [2023-12-02 20:46:40,172 INFO L378 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 9 treesize of output 5 [2023-12-02 20:46:40,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:40,194 INFO L378 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 49 treesize of output 51 [2023-12-02 20:46:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354518336] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:42,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:42,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2023-12-02 20:46:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322005164] [2023-12-02 20:46:42,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:42,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 20:46:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 20:46:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=444, Unknown=3, NotChecked=44, Total=600 [2023-12-02 20:46:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:42,369 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:42,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:42,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:42,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:42,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:42,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:42,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:46:42,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:46:43,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:43,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:43,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash -236625567, now seen corresponding path program 1 times [2023-12-02 20:46:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52783267] [2023-12-02 20:46:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:43,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:43,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:43,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52783267] [2023-12-02 20:46:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52783267] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288173840] [2023-12-02 20:46:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:43,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:43,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:43,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:46:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:44,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 20:46:44,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:44,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:44,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:46:44,074 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 20:46:44,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 20:46:44,100 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 20:46:44,100 INFO L378 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 29 treesize of output 34 [2023-12-02 20:46:44,200 INFO L378 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 24 treesize of output 19 [2023-12-02 20:46:44,257 INFO L378 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 43 treesize of output 34 [2023-12-02 20:46:44,334 INFO L378 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 51 treesize of output 42 [2023-12-02 20:46:44,456 INFO L378 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 62 treesize of output 49 [2023-12-02 20:46:44,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:46:44,511 INFO L378 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 53 treesize of output 38 [2023-12-02 20:46:44,594 INFO L378 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 61 treesize of output 45 [2023-12-02 20:46:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:44,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:44,676 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array Int Int)) (v_ArrVal_237 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_236) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_237)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 20:46:44,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_234 Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_237 Int)) (or (< (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_234)) |c_~#stored_elements~0.base| v_ArrVal_236) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_237)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_234))) is different from false [2023-12-02 20:46:44,717 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_234 Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_237 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_234)) |c_~#stored_elements~0.base| v_ArrVal_236) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_237)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_234))))) is different from false [2023-12-02 20:46:44,740 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((v_ArrVal_234 Int) (v_ArrVal_233 Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_237 Int)) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_233) .cse3 v_ArrVal_234)) |c_~#stored_elements~0.base| v_ArrVal_236) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_237)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_233) (< (+ .cse0 1) v_ArrVal_234)))))) is different from false [2023-12-02 20:46:46,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_234 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_237 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_229))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)) v_ArrVal_231)))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_233) (= 400 .cse2) (< (+ .cse2 1) v_ArrVal_234) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_233) .cse4 v_ArrVal_234)) |c_~#stored_elements~0.base| v_ArrVal_236) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) v_ArrVal_237)) .cse1) 2147483647)))))) is different from false [2023-12-02 20:46:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:46:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288173840] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:47,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2023-12-02 20:46:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763200776] [2023-12-02 20:46:47,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:47,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 20:46:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 20:46:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=313, Unknown=6, NotChecked=210, Total=650 [2023-12-02 20:46:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:47,069 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:47,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:47,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:46:47,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:50,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_234 Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_237 Int)) (or (< (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_234)) |c_~#stored_elements~0.base| v_ArrVal_236) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_237)) .cse2) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_234))) (forall ((v_ArrVal_237 Int)) (< (select (store .cse3 .cse4 v_ArrVal_237) .cse2) 2147483647)) (forall ((v_ArrVal_234 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_237 Int)) (let ((.cse6 (store .cse3 .cse4 v_ArrVal_231))) (let ((.cse7 (select .cse6 .cse1))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_233) .cse1 v_ArrVal_234)) |c_~#stored_elements~0.base| v_ArrVal_236) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_237)) .cse2) 2147483647) (< (+ (select .cse6 .cse2) 1) v_ArrVal_233) (= 400 .cse7) (< (+ .cse7 1) v_ArrVal_234)))))))) is different from false [2023-12-02 20:46:52,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:46:54,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:46:56,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:46:58,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:46:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:46:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:46:58,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:46:58,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:58,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:46:58,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 236117380, now seen corresponding path program 1 times [2023-12-02 20:46:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481313131] [2023-12-02 20:46:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481313131] [2023-12-02 20:46:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481313131] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467446864] [2023-12-02 20:46:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:59,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:59,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:59,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:59,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:46:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:59,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 20:46:59,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:47:00,009 INFO L378 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 35 treesize of output 19 [2023-12-02 20:47:00,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:00,055 INFO L378 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 26 treesize of output 19 [2023-12-02 20:47:00,110 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 20:47:00,110 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-12-02 20:47:00,161 INFO L378 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 33 treesize of output 17 [2023-12-02 20:47:00,174 INFO L378 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 25 treesize of output 13 [2023-12-02 20:47:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:00,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:47:00,291 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 Int) (v_ArrVal_299 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_299) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_301)) .cse1))))) is different from false [2023-12-02 20:47:00,299 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 Int) (v_ArrVal_299 (Array Int Int))) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_299) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_301)) .cse1)) 2147483650))) is different from false [2023-12-02 20:47:00,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:47:00,418 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2023-12-02 20:47:00,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:47:00,427 INFO L378 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 74 treesize of output 74 [2023-12-02 20:47:00,433 INFO L378 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 36 treesize of output 24 [2023-12-02 20:47:00,441 INFO L378 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 17 treesize of output 9 [2023-12-02 20:47:00,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:47:00,466 INFO L378 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 59 treesize of output 47 [2023-12-02 20:47:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:00,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467446864] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:47:00,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:47:00,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-12-02 20:47:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754135323] [2023-12-02 20:47:00,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:47:00,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 20:47:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:00,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 20:47:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=590, Unknown=2, NotChecked=102, Total=812 [2023-12-02 20:47:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:00,565 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:00,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:47:00,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:47:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:47:01,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 20:47:01,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:01,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:47:01,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:47:01,291 INFO L85 PathProgramCache]: Analyzing trace with hash -982918871, now seen corresponding path program 1 times [2023-12-02 20:47:01,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:47:01,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578821467] [2023-12-02 20:47:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:47:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:47:01,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578821467] [2023-12-02 20:47:01,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578821467] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:47:01,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345401360] [2023-12-02 20:47:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:01,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:47:01,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:47:01,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:47:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:01,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 20:47:01,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:47:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:01,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:47:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345401360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:47:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:47:01,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 20:47:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966258432] [2023-12-02 20:47:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:47:01,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:47:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:47:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:47:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:01,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:01,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:47:01,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:47:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:47:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:01,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:47:01,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 20:47:01,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:47:01,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:47:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash -405713276, now seen corresponding path program 1 times [2023-12-02 20:47:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:47:01,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091400297] [2023-12-02 20:47:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:01,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:47:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:47:02,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:47:02,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091400297] [2023-12-02 20:47:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091400297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:47:02,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:47:02,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:47:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361217863] [2023-12-02 20:47:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:47:02,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:47:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:47:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:47:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:02,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:02,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:47:02,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:02,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:02,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:02,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:02,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:02,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:47:02,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:47:02,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:47:02,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:02,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 20:47:02,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:47:02,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:47:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -712516148, now seen corresponding path program 1 times [2023-12-02 20:47:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:47:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909751662] [2023-12-02 20:47:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:47:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:03,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:47:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909751662] [2023-12-02 20:47:03,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909751662] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:47:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345520132] [2023-12-02 20:47:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:03,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:47:03,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:47:03,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:47:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:03,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-02 20:47:03,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:47:03,835 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 20:47:03,835 INFO L378 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 29 treesize of output 34 [2023-12-02 20:47:03,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:03,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:47:03,855 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 20:47:03,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 20:47:03,952 INFO L378 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 24 treesize of output 19 [2023-12-02 20:47:04,015 INFO L378 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 43 treesize of output 34 [2023-12-02 20:47:04,078 INFO L378 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 38 treesize of output 31 [2023-12-02 20:47:04,206 INFO L378 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 44 treesize of output 33 [2023-12-02 20:47:04,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:04,248 INFO L378 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 35 treesize of output 26 [2023-12-02 20:47:04,276 INFO L378 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 54 treesize of output 41 [2023-12-02 20:47:04,339 INFO L378 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 49 treesize of output 38 [2023-12-02 20:47:04,481 INFO L378 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 51 treesize of output 38 [2023-12-02 20:47:04,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:04,523 INFO L378 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 42 treesize of output 31 [2023-12-02 20:47:04,574 INFO L378 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 61 treesize of output 46 [2023-12-02 20:47:04,622 INFO L378 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 56 treesize of output 43 [2023-12-02 20:47:04,662 INFO L378 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 48 treesize of output 36 [2023-12-02 20:47:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:04,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:47:04,752 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_496 Int) (v_ArrVal_495 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_496)) .cse1)) 2147483647)) is different from false [2023-12-02 20:47:04,761 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_496 Int) (v_ArrVal_495 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_496)) .cse1)) 2147483647)) is different from false [2023-12-02 20:47:04,776 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_496 Int) (v_ArrVal_495 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_496)) .cse1)) 2147483647))) is different from false [2023-12-02 20:47:04,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_496 Int) (v_ArrVal_491 Int) (v_ArrVal_495 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_491) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_496)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2023-12-02 20:47:05,166 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_489 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (v_ArrVal_491 Int) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_485) .cse8 (+ .cse0 1))))) (let ((.cse4 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) v_ArrVal_489)))) (let ((.cse5 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_491) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_496)) .cse2) 2147483647) (= 400 .cse5))))))))) is different from false [2023-12-02 20:47:05,355 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_489 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_483 Int) (v_ArrVal_491 Int) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_481))) (let ((.cse8 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse1))) v_ArrVal_483)))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse8 .cse1))) (let ((.cse3 (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_485) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) v_ArrVal_489)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_491) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_496)) .cse1) 2147483647) (= 400 .cse6) (= 400 .cse5)))))))) is different from false [2023-12-02 20:47:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-12-02 20:47:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345520132] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:47:05,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:47:05,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 38 [2023-12-02 20:47:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800809484] [2023-12-02 20:47:05,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:47:05,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 20:47:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:05,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 20:47:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=858, Unknown=15, NotChecked=414, Total=1560 [2023-12-02 20:47:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:05,460 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:05,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:47:05,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:47:05,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:05,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:05,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:06,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse12 .cse13)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_489 Int) (v_ArrVal_496 Int) (v_ArrVal_491 Int) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse3 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_489)))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_491) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_496)) .cse2) 2147483647))))) (< .cse6 2147483647) (or (forall ((v_ArrVal_489 Int) (v_ArrVal_496 Int) (v_ArrVal_491 Int) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse6 1))))) (let ((.cse10 (let ((.cse11 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_489)))) (let ((.cse7 (select .cse10 .cse2))) (or (= 400 .cse7) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_491) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse2)) |c_~#queue~0.offset|) v_ArrVal_496)) .cse2) 2147483647)))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) (forall ((v_ArrVal_496 Int) (v_ArrVal_495 (Array Int Int))) (< (select (let ((.cse14 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_496)) .cse2) 2147483647)) (forall ((v_ArrVal_489 Int) (v_ArrVal_485 Int) (v_ArrVal_496 Int) (v_ArrVal_483 Int) (v_ArrVal_491 Int) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse20 (let ((.cse21 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_483)))) (let ((.cse16 (select .cse20 .cse2))) (let ((.cse18 (let ((.cse19 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_485) .cse2 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_488) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) v_ArrVal_489)))) (let ((.cse15 (select .cse18 .cse2))) (or (= 400 .cse15) (= 400 .cse16) (< (select (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse18 .cse4 v_ArrVal_491) .cse2 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse2) 4)) v_ArrVal_496)) .cse2) 2147483647)))))))))) is different from false [2023-12-02 20:47:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:47:06,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:47:07,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:07,049 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:47:07,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:47:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1308815999, now seen corresponding path program 2 times [2023-12-02 20:47:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:47:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282484505] [2023-12-02 20:47:07,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:47:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:47:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282484505] [2023-12-02 20:47:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282484505] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:47:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205005229] [2023-12-02 20:47:09,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:47:09,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:47:09,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:47:09,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 20:47:09,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:47:09,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:47:09,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 93 conjunts are in the unsatisfiable core [2023-12-02 20:47:09,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:47:09,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:09,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:09,255 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:47:09,267 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 20:47:09,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 20:47:09,287 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 20:47:09,288 INFO L378 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 29 treesize of output 34 [2023-12-02 20:47:09,393 INFO L378 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 24 treesize of output 19 [2023-12-02 20:47:09,480 INFO L378 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 43 treesize of output 34 [2023-12-02 20:47:09,556 INFO L378 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 51 treesize of output 42 [2023-12-02 20:47:09,689 INFO L378 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 62 treesize of output 49 [2023-12-02 20:47:09,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:09,734 INFO L378 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 53 treesize of output 38 [2023-12-02 20:47:09,788 INFO L378 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 72 treesize of output 53 [2023-12-02 20:47:09,903 INFO L378 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 92 treesize of output 69 [2023-12-02 20:47:10,315 INFO L378 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 242 treesize of output 193 [2023-12-02 20:47:10,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:10,541 INFO L378 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 521 treesize of output 432 [2023-12-02 20:47:10,717 INFO L378 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 540 treesize of output 447 [2023-12-02 20:47:11,519 INFO L378 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 2085 treesize of output 1780 [2023-12-02 20:47:17,866 INFO L378 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 8210 treesize of output 6919 [2023-12-02 20:47:25,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:47:25,512 INFO L378 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 23827 treesize of output 20080 [2023-12-02 20:47:35,173 INFO L378 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 23835 treesize of output 20087 [2023-12-02 20:47:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:47:35,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:47:36,044 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 20:47:36,055 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_612 Int)) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_609) (< (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-12-02 20:47:36,077 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_612 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_609)))) is different from false [2023-12-02 20:47:36,096 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_612 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_608) (< (+ (select .cse1 .cse2) 1) v_ArrVal_609)))) is different from false [2023-12-02 20:47:42,443 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_602)))) (let ((.cse0 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_609) (< (+ (select .cse0 .cse2) 1) v_ArrVal_608) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse2) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_602))))) is different from false [2023-12-02 20:47:42,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_602)))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_609) (< (+ (select .cse0 .cse2) 1) v_ArrVal_608) (< (+ (select .cse3 .cse4) 1) v_ArrVal_602) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse2) 2147483647)))))) is different from false [2023-12-02 20:47:42,529 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_600) .cse1 v_ArrVal_602)))) (let ((.cse2 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_600) (< (+ (select .cse0 .cse1) 1) v_ArrVal_602) (< (+ (select .cse2 .cse3) 1) v_ArrVal_609) (< (+ (select .cse2 .cse4) 1) v_ArrVal_608) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_608) .cse3 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse3)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse4) 2147483647)))))) is different from false [2023-12-02 20:47:53,347 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_595 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_595)))) (let ((.cse0 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) v_ArrVal_599))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse6 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_600) .cse1 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_602) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_612)) .cse5) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_609) (< (+ (select .cse4 .cse5) 1) v_ArrVal_608) (< (+ (select .cse0 .cse5) 1) v_ArrVal_600) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_595)))))) is different from false [2023-12-02 20:47:58,359 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int) (v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_595 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_593 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_593) .cse7 v_ArrVal_595)))) (let ((.cse0 (let ((.cse9 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_599))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse8 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_600) .cse3 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse3))) v_ArrVal_605)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_600) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_593) (< (+ (select .cse2 .cse1) 1) v_ArrVal_608) (< (+ (select .cse2 .cse3) 1) v_ArrVal_609) (< (+ (select .cse0 .cse3) 1) v_ArrVal_602) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_608) .cse3 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_595))))))) is different from false [2023-12-02 20:48:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 11 refuted. 2 times theorem prover too weak. 0 trivial. 23 not checked. [2023-12-02 20:48:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205005229] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:48:22,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:48:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 50 [2023-12-02 20:48:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635382278] [2023-12-02 20:48:22,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:48:22,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 20:48:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:48:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 20:48:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1326, Unknown=65, NotChecked=810, Total=2652 [2023-12-02 20:48:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:22,303 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:48:22,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:48:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:25,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:48:30,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:48:32,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:48:40,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:48:42,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:48:54,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:48:56,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:48:58,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:00,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:17,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:19,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:29,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:32,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:34,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:36,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:38,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:49:52,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:50:04,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|)) (.cse17 (+ (select .cse21 .cse22) 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_599))) (let ((.cse3 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_600) .cse2 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_605)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_600) (< (+ (select .cse0 .cse2) 1) v_ArrVal_602) (< (+ (select .cse3 .cse2) 1) v_ArrVal_609) (< (+ (select .cse3 .cse1) 1) v_ArrVal_608) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse2)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647))))) (forall ((v_ArrVal_612 Int)) (< (select (store .cse6 .cse7 v_ArrVal_612) .cse1) 2147483647)) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse9 (store .cse6 .cse7 v_ArrVal_605))) (or (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_612)) .cse1) 2147483647) (< (+ (select .cse9 .cse2) 1) v_ArrVal_609) (< (+ (select .cse9 .cse1) 1) v_ArrVal_608)))) (forall ((v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int) (v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_595 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_593 Int) (v_ArrVal_591 Int)) (let ((.cse12 (store .cse6 .cse7 v_ArrVal_591))) (let ((.cse10 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse1 v_ArrVal_593) .cse2 v_ArrVal_595)) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_599)))) (let ((.cse11 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse1 v_ArrVal_600) .cse2 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)) v_ArrVal_605)))) (or (< (+ (select .cse10 .cse1) 1) v_ArrVal_600) (< (+ (select .cse11 .cse1) 1) v_ArrVal_608) (< (+ (select .cse12 .cse1) 1) v_ArrVal_593) (< (+ (select .cse11 .cse2) 1) v_ArrVal_609) (< (+ (select .cse10 .cse2) 1) v_ArrVal_602) (< (+ (select .cse12 .cse2) 1) v_ArrVal_595) (< (select (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647)))))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse22 v_ArrVal_602)))) (let ((.cse16 (let ((.cse20 (select (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse16 .cse2) 1) v_ArrVal_609) (< (+ (select .cse16 .cse1) 1) v_ArrVal_608) (< .cse17 v_ArrVal_602) (< (select (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse16 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse18 (+ (* 4 (select .cse18 .cse2)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647))))) (forall ((v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_595 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse22 v_ArrVal_595)))) (let ((.cse23 (let ((.cse28 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (store .cse28 (+ (* 4 (select .cse28 .cse2)) |c_~#queue~0.offset|) v_ArrVal_599)))) (let ((.cse26 (let ((.cse27 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse23 .cse1 v_ArrVal_600) .cse2 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse23 .cse2) 1) v_ArrVal_602) (< (select (let ((.cse24 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse2) 4)) v_ArrVal_612)) .cse1) 2147483647) (< (+ (select .cse26 .cse2) 1) v_ArrVal_609) (< (+ (select .cse26 .cse1) 1) v_ArrVal_608) (< (+ (select .cse23 .cse1) 1) v_ArrVal_600) (< .cse17 v_ArrVal_595)))))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse29 (let ((.cse31 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse29 .cse1) 1) v_ArrVal_608) (< (select (let ((.cse30 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse29 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647) (< (+ (select .cse29 .cse2) 1) v_ArrVal_609)))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_612 Int)) (or (< (select (let ((.cse32 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse22 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse32 (+ |c_~#queue~0.offset| (* (select .cse32 .cse2) 4)) v_ArrVal_612)) .cse1) 2147483647) (< .cse17 v_ArrVal_609))) (forall ((v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse34 (let ((.cse37 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (store .cse37 (+ |c_~#queue~0.offset| (* (select .cse37 .cse2) 4)) v_ArrVal_599)))) (let ((.cse33 (let ((.cse36 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse34 .cse1 v_ArrVal_600) .cse2 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse36 (+ |c_~#queue~0.offset| (* (select .cse36 .cse2) 4)) v_ArrVal_605)))) (or (< (+ (select .cse33 .cse1) 1) v_ArrVal_608) (< (+ (select .cse34 .cse1) 1) v_ArrVal_600) (< (+ (select .cse34 .cse2) 1) v_ArrVal_602) (< (select (let ((.cse35 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse33 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647) (< (+ (select .cse33 .cse2) 1) v_ArrVal_609)))))))) is different from false [2023-12-02 20:50:04,090 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_496 Int) (v_ArrVal_495 (Array Int Int))) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_496)) .cse3)) 2147483647)))) is different from false [2023-12-02 20:50:04,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_602)))) (let ((.cse0 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_609) (< (+ (select .cse0 .cse2) 1) v_ArrVal_608) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse2) 2147483647) (< .cse5 v_ArrVal_602))))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_612 Int)) (or (< .cse5 v_ArrVal_609) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_612)) .cse2) 2147483647))) (forall ((v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_595 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_595)))) (let ((.cse10 (let ((.cse15 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse1)) |c_~#queue~0.offset|) v_ArrVal_599)))) (let ((.cse13 (let ((.cse14 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_600) .cse1 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse10 .cse1) 1) v_ArrVal_602) (< (select (let ((.cse11 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_612)) .cse2) 2147483647) (< (+ (select .cse13 .cse1) 1) v_ArrVal_609) (< (+ (select .cse13 .cse2) 1) v_ArrVal_608) (< (+ (select .cse10 .cse2) 1) v_ArrVal_600) (< .cse5 v_ArrVal_595)))))))) is different from false [2023-12-02 20:50:04,117 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_496 Int) (v_ArrVal_495 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_495) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_496)) .cse1)) 2147483647))) is different from false [2023-12-02 20:50:04,128 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_612)) .cse2) 2147483647)) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse3 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse3 .cse2) 1) v_ArrVal_608) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse2) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_609)))) (forall ((v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse7 (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) v_ArrVal_599)))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_600) .cse1 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_605)))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_608) (< (+ (select .cse7 .cse2) 1) v_ArrVal_600) (< (+ (select .cse7 .cse1) 1) v_ArrVal_602) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse2) 2147483647) (< (+ (select .cse6 .cse1) 1) v_ArrVal_609))))))) is different from false [2023-12-02 20:50:06,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_599 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_599))) (let ((.cse3 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_600) .cse2 v_ArrVal_602)) |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_605)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_600) (< (+ (select .cse0 .cse2) 1) v_ArrVal_602) (< (+ (select .cse3 .cse2) 1) v_ArrVal_609) (< (+ (select .cse3 .cse1) 1) v_ArrVal_608) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse2)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647))))) (forall ((v_ArrVal_612 Int)) (< (select (store .cse6 .cse7 v_ArrVal_612) .cse1) 2147483647)) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse9 (store .cse6 .cse7 v_ArrVal_605))) (or (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_612)) .cse1) 2147483647) (< (+ (select .cse9 .cse2) 1) v_ArrVal_609) (< (+ (select .cse9 .cse1) 1) v_ArrVal_608))))))) is different from false [2023-12-02 20:50:06,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (.cse7 (+ (select .cse2 .cse4) 1)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_612 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_608) .cse4 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse5) 2147483647) (< .cse6 v_ArrVal_608) (< .cse7 v_ArrVal_609))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_600) .cse4 v_ArrVal_602)))) (let ((.cse8 (let ((.cse11 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< .cse6 v_ArrVal_600) (< .cse7 v_ArrVal_602) (< (+ (select .cse8 .cse1) 1) v_ArrVal_609) (< (+ (select .cse8 .cse5) 1) v_ArrVal_608) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse5) 2147483647))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2023-12-02 20:50:14,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_602 Int) (v_ArrVal_612 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_602)))) (let ((.cse0 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_609) (< (+ (select .cse0 .cse2) 1) v_ArrVal_608) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse2) 2147483647) (< .cse5 v_ArrVal_602))))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_612 Int)) (or (< .cse5 v_ArrVal_609) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_612)) .cse2) 2147483647))))) is different from false [2023-12-02 20:50:14,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_612)) .cse2) 2147483647)) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse3 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_604) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (or (< (+ (select .cse3 .cse2) 1) v_ArrVal_608) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_608) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse2) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_609)))))) is different from false [2023-12-02 20:50:44,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:47,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:50,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:52,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:50:54,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:56,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:58,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:00,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:02,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:04,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:07,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:09,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:11,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:13,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:13,027 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (v_ArrVal_612 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_608) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_608) (< (+ (select .cse1 .cse2) 1) v_ArrVal_609)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 20:51:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:51:13,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 20:51:13,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:51:13,242 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:51:13,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:51:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1702059333, now seen corresponding path program 2 times [2023-12-02 20:51:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:51:13,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113711373] [2023-12-02 20:51:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:51:13,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:51:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:51:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:51:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:51:16,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113711373] [2023-12-02 20:51:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113711373] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:51:16,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861698927] [2023-12-02 20:51:16,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:51:16,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:51:16,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:51:16,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:51:16,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:51:16,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:51:16,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:51:16,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 159 conjunts are in the unsatisfiable core [2023-12-02 20:51:16,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:51:16,424 INFO L349 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2023-12-02 20:51:16,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 67 [2023-12-02 20:51:16,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:51:16,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2023-12-02 20:51:16,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-12-02 20:51:16,662 INFO L378 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 49 treesize of output 43 [2023-12-02 20:51:16,718 INFO L378 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 44 treesize of output 40 [2023-12-02 20:51:16,833 INFO L378 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 50 treesize of output 42 [2023-12-02 20:51:16,893 INFO L378 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 41 treesize of output 30 [2023-12-02 20:51:16,952 INFO L378 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 54 treesize of output 41 [2023-12-02 20:51:17,027 INFO L378 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 49 treesize of output 38 [2023-12-02 20:51:17,161 INFO L378 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 51 treesize of output 38 [2023-12-02 20:51:17,209 INFO L378 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 42 treesize of output 31 [2023-12-02 20:51:17,239 INFO L378 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 61 treesize of output 46 [2023-12-02 20:51:17,315 INFO L378 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 56 treesize of output 43 [2023-12-02 20:51:17,455 INFO L378 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 58 treesize of output 43 [2023-12-02 20:51:17,507 INFO L378 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 49 treesize of output 36 [2023-12-02 20:51:17,534 INFO L378 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 68 treesize of output 51 [2023-12-02 20:51:17,643 INFO L378 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 63 treesize of output 48 [2023-12-02 20:51:17,818 INFO L378 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 65 treesize of output 48 [2023-12-02 20:51:17,885 INFO L378 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 56 treesize of output 41 [2023-12-02 20:51:17,930 INFO L378 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 75 treesize of output 56 [2023-12-02 20:51:18,030 INFO L378 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 70 treesize of output 53 [2023-12-02 20:51:18,211 INFO L378 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 72 treesize of output 53 [2023-12-02 20:51:18,278 INFO L378 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 63 treesize of output 46 [2023-12-02 20:51:18,361 INFO L378 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 82 treesize of output 61 [2023-12-02 20:51:18,455 INFO L378 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 77 treesize of output 58 [2023-12-02 20:51:18,526 INFO L378 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 69 treesize of output 51 [2023-12-02 20:51:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:51:18,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:51:18,703 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1)) 2147483647)) is different from false [2023-12-02 20:51:18,718 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_777)) .cse1)) 2147483647)) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2023-12-02 20:51:18,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_772 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_772) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_777)) .cse2)) 2147483647))))) is different from false [2023-12-02 20:51:19,063 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse4 (let ((.cse5 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_772) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647)))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2023-12-02 20:51:19,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_764) .cse7 (+ .cse8 1))))) (let ((.cse4 (let ((.cse5 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_772) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647)))))) (= 400 .cse8)))) is different from false [2023-12-02 20:51:19,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse12 (select .cse10 .cse11))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_758) .cse11 (+ .cse12 1))))) (let ((.cse8 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse8 .cse3))) (let ((.cse5 (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_764) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse3))) v_ArrVal_770)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_772) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_777)) .cse3) 2147483647)))))))) (= 400 .cse12)))) is different from false [2023-12-02 20:51:20,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse11 (let ((.cse12 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_755)))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse11 .cse3))) (let ((.cse9 (let ((.cse10 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_758) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse0 (select .cse9 .cse3))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_764) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_772) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_777)) .cse3) 2147483647) (= 400 .cse7)))))))))) is different from false [2023-12-02 20:51:20,510 WARN L854 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))))) (let ((.cse11 (let ((.cse12 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)) v_ArrVal_755)))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse11 .cse1))) (let ((.cse9 (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_758) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse7 (select .cse9 .cse1))) (let ((.cse3 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_764) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_770)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_772) .cse1 (+ 1 .cse5))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1) 2147483647) (= .cse6 400) (= 400 .cse7) (= 400 .cse5))))))))))) is different from false [2023-12-02 20:51:20,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse14 .cse15))) (or (= 400 .cse0) (forall ((v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_751) .cse15 (+ .cse0 1))))) (let ((.cse12 (let ((.cse13 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select .cse12 .cse4))) (let ((.cse10 (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_758) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)) v_ArrVal_763)))) (let ((.cse8 (select .cse10 .cse4))) (let ((.cse6 (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_764) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse4) 4)) v_ArrVal_770)))) (let ((.cse1 (select .cse6 .cse4))) (or (= 400 .cse1) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_772) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_777)) .cse4) 2147483647) (= 400 .cse8))))))))))))) is different from false [2023-12-02 20:51:21,073 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_749 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_770 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse13 (let ((.cse14 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_747) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_749)))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse13 .cse1))) (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse3 v_ArrVal_751) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse1)) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse7 (select .cse11 .cse1))) (let ((.cse9 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_758) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse6 (select .cse9 .cse1))) (let ((.cse2 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_764) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_770)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_772) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1) 2147483647) (= 400 .cse4) (= 400 .cse5) (= 400 .cse6) (= 400 .cse7)))))))))))) is different from false [2023-12-02 20:51:21,446 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_749 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_770 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse16 .cse17 (+ (select .cse16 .cse17) 1)))))) (let ((.cse14 (let ((.cse15 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_747) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse2))) v_ArrVal_749)))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse14 .cse2))) (let ((.cse12 (let ((.cse13 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_751) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse7 (select .cse12 .cse2))) (let ((.cse10 (let ((.cse11 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_758) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_763)))) (let ((.cse6 (select .cse10 .cse2))) (let ((.cse4 (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_764) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) v_ArrVal_770)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_772) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647) (= 400 .cse6) (= 400 .cse7) (= 400 .cse8)))))))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2023-12-02 20:51:21,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse17 .cse18))) (or (= 400 .cse0) (forall ((v_ArrVal_749 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_743 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_770 Int)) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse17 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_743) .cse18 (+ .cse0 1))))) (let ((.cse15 (let ((.cse16 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_747) |c_~#queue~0.base|))) (store .cse16 (+ (* 4 (select .cse16 .cse5)) |c_~#queue~0.offset|) v_ArrVal_749)))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select .cse15 .cse5))) (let ((.cse13 (let ((.cse14 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_751) .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse3 (select .cse13 .cse5))) (let ((.cse11 (let ((.cse12 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_758) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse9 (select .cse11 .cse5))) (let ((.cse7 (let ((.cse10 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_764) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse2 (select .cse7 .cse5))) (or (= 400 .cse1) (= .cse2 400) (= .cse3 400) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_772) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse5) 2147483647) (= 400 .cse9))))))))))))))) is different from false [2023-12-02 20:51:22,232 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_749 Int) (v_ArrVal_758 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_743 Int) (v_ArrVal_764 Int) (v_ArrVal_741 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_770 Int)) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_740))) (let ((.cse17 (let ((.cse18 (select .cse6 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse5) 4)) v_ArrVal_741)))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse17 .cse5))) (let ((.cse15 (let ((.cse16 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse17 .cse8 v_ArrVal_743) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_~#queue~0.base|))) (store .cse16 (+ (* 4 (select .cse16 .cse5)) |c_~#queue~0.offset|) v_ArrVal_749)))) (let ((.cse1 (select .cse15 .cse5))) (let ((.cse13 (let ((.cse14 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_751) .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse5) 4)) v_ArrVal_755)))) (let ((.cse9 (select .cse13 .cse5))) (let ((.cse11 (let ((.cse12 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_758) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse2 (select .cse11 .cse5))) (let ((.cse7 (let ((.cse10 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_764) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse0 (select .cse7 .cse5))) (or (= 400 .cse0) (= 400 .cse1) (= 400 .cse2) (= 400 .cse3) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_772) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse5) 2147483647) (= 400 .cse9)))))))))))))) is different from false [2023-12-02 20:51:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 42 refuted. 12 times theorem prover too weak. 0 trivial. 66 not checked. [2023-12-02 20:51:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861698927] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:51:22,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:51:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26, 29] total 75 [2023-12-02 20:51:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431607630] [2023-12-02 20:51:22,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:51:22,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-12-02 20:51:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:51:22,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-12-02 20:51:22,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=3062, Unknown=96, NotChecked=1768, Total=5852 [2023-12-02 20:51:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:51:22,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:51:22,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.3815789473684212) internal successors, (181), 76 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:22,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-12-02 20:51:22,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:51:22,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:51:26,678 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse12 (select .cse10 .cse11)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (or (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 (+ .cse12 1))))) (let ((.cse8 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse6 (select .cse8 .cse1))) (let ((.cse3 (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_764) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_772) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1) 2147483647) (= 400 .cse5) (= 400 .cse6)))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) (forall ((v_ArrVal_749 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_770 Int)) (let ((.cse24 (let ((.cse25 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_747) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_749)))) (let ((.cse16 (select .cse24 .cse1))) (let ((.cse22 (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse24 .cse4 v_ArrVal_751) .cse1 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse1)) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse18 (select .cse22 .cse1))) (let ((.cse20 (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_758) .cse1 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse17 (select .cse20 .cse1))) (let ((.cse14 (let ((.cse19 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_764) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)) v_ArrVal_770)))) (let ((.cse15 (select .cse14 .cse1))) (or (< (select (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_772) .cse1 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1) 2147483647) (= 400 .cse15) (= 400 .cse16) (= 400 .cse17) (= 400 .cse18))))))))))) (forall ((v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse34 (let ((.cse35 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse30 (select .cse34 .cse1))) (let ((.cse32 (let ((.cse33 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse34 .cse4 v_ArrVal_758) .cse1 (+ .cse30 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse26 (select .cse32 .cse1))) (let ((.cse28 (let ((.cse31 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse32 .cse4 v_ArrVal_764) .cse1 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse29 (select .cse28 .cse1))) (or (= 400 .cse26) (< (select (let ((.cse27 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse28 .cse4 v_ArrVal_772) .cse1 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* 4 (select .cse27 .cse1))) v_ArrVal_777)) .cse1) 2147483647) (= 400 .cse30) (= .cse29 400))))))))) (< .cse12 2147483647) (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse41 (let ((.cse42 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse42 (+ (* (select .cse42 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse39 (select .cse41 .cse1))) (let ((.cse37 (let ((.cse40 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse41 .cse4 v_ArrVal_764) .cse1 (+ .cse39 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse40 (+ (* (select .cse40 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse38 (select .cse37 .cse1))) (or (< (select (let ((.cse36 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse37 .cse4 v_ArrVal_772) .cse1 (+ .cse38 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse36 (+ (* (select .cse36 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1) 2147483647) (= 400 .cse39) (= 400 .cse38))))))) (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse45 (let ((.cse46 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse46 (+ |c_~#queue~0.offset| (* (select .cse46 .cse1) 4)) v_ArrVal_770)))) (let ((.cse43 (select .cse45 .cse1))) (or (= 400 .cse43) (< (select (let ((.cse44 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse45 .cse4 v_ArrVal_772) .cse1 (+ .cse43 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse44 (+ |c_~#queue~0.offset| (* (select .cse44 .cse1) 4)) v_ArrVal_777)) .cse1) 2147483647))))) (forall ((v_ArrVal_749 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_743 Int) (v_ArrVal_764 Int) (v_ArrVal_741 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_770 Int)) (let ((.cse61 (let ((.cse62 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse62 (+ (* (select .cse62 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_741)))) (let ((.cse50 (select .cse61 .cse1))) (let ((.cse59 (let ((.cse60 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse61 .cse4 v_ArrVal_743) .cse1 (+ .cse50 1))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_~#queue~0.base|))) (store .cse60 (+ (* (select .cse60 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_749)))) (let ((.cse49 (select .cse59 .cse1))) (let ((.cse57 (let ((.cse58 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse59 .cse4 v_ArrVal_751) .cse1 (+ .cse49 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse58 (+ (* (select .cse58 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse51 (select .cse57 .cse1))) (let ((.cse55 (let ((.cse56 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse57 .cse4 v_ArrVal_758) .cse1 (+ .cse51 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse56 (+ (* (select .cse56 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse48 (select .cse55 .cse1))) (let ((.cse53 (let ((.cse54 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse55 .cse4 v_ArrVal_764) .cse1 (+ .cse48 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse54 (+ |c_~#queue~0.offset| (* (select .cse54 .cse1) 4)) v_ArrVal_770)))) (let ((.cse47 (select .cse53 .cse1))) (or (= 400 .cse47) (= .cse48 400) (= 400 .cse49) (= 400 .cse50) (= 400 .cse51) (< (select (let ((.cse52 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse53 .cse4 v_ArrVal_772) .cse1 (+ .cse47 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse52 (+ (* (select .cse52 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1) 2147483647))))))))))))) (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (select (let ((.cse63 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse63 (+ (* (select .cse63 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse1) 2147483647))))) is different from false [2023-12-02 20:51:27,018 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse16 (select .cse3 .cse5))) (let ((.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ .cse16 1)) (.cse0 (= 400 .cse16)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (or .cse0 (forall ((v_ArrVal_772 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_772) .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_758) .cse5 .cse6)))) (let ((.cse14 (let ((.cse15 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse7 (select .cse14 .cse2))) (let ((.cse11 (let ((.cse13 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse14 .cse12 v_ArrVal_764) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse2))) v_ArrVal_770)))) (let ((.cse8 (select .cse11 .cse2))) (or (= 400 .cse7) (= 400 .cse8) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_772) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647)))))))) .cse0) (< .cse16 2147483647) (or .cse0 (forall ((v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_751) .cse5 .cse6)))) (let ((.cse26 (let ((.cse27 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse18 (select .cse26 .cse2))) (let ((.cse24 (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse26 .cse12 v_ArrVal_758) .cse2 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse2) 4)) v_ArrVal_763)))) (let ((.cse22 (select .cse24 .cse2))) (let ((.cse21 (let ((.cse23 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse24 .cse12 v_ArrVal_764) .cse2 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse2) 4)) v_ArrVal_770)))) (let ((.cse17 (select .cse21 .cse2))) (or (= 400 .cse17) (= 400 .cse18) (< (select (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse12 v_ArrVal_772) .cse2 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647) (= 400 .cse22))))))))))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse30 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_764) .cse5 .cse6)))) (let ((.cse31 (let ((.cse32 (select (store .cse30 |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse28 (select .cse31 .cse2))) (or (= 400 .cse28) (< (select (let ((.cse29 (select (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse12 v_ArrVal_772) .cse2 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse29 (+ (* 4 (select .cse29 .cse2)) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647)))))) .cse0) (forall ((v_ArrVal_749 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int)) (let ((.cse44 (let ((.cse45 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse45 (+ (* (select .cse45 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_749)))) (let ((.cse38 (select .cse44 .cse2))) (let ((.cse42 (let ((.cse43 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse44 .cse12 v_ArrVal_751) .cse2 (+ .cse38 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse43 (+ |c_~#queue~0.offset| (* 4 (select .cse43 .cse2))) v_ArrVal_755)))) (let ((.cse33 (select .cse42 .cse2))) (let ((.cse40 (let ((.cse41 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse42 .cse12 v_ArrVal_758) .cse2 (+ .cse33 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse41 (+ (* (select .cse41 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse35 (select .cse40 .cse2))) (let ((.cse37 (let ((.cse39 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse40 .cse12 v_ArrVal_764) .cse2 (+ .cse35 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse39 (+ |c_~#queue~0.offset| (* (select .cse39 .cse2) 4)) v_ArrVal_770)))) (let ((.cse34 (select .cse37 .cse2))) (or (= .cse33 400) (= 400 .cse34) (= 400 .cse35) (< (select (let ((.cse36 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse37 .cse12 v_ArrVal_772) .cse2 (+ .cse34 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse36 (+ |c_~#queue~0.offset| (* (select .cse36 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647) (= .cse38 400))))))))))))))) is different from false [2023-12-02 20:51:27,061 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse16 (select .cse3 .cse5))) (let ((.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ .cse16 1)) (.cse0 (= 400 .cse16))) (and (or .cse0 (forall ((v_ArrVal_772 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_772) .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_758) .cse5 .cse6)))) (let ((.cse14 (let ((.cse15 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse7 (select .cse14 .cse2))) (let ((.cse11 (let ((.cse13 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse14 .cse12 v_ArrVal_764) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse2))) v_ArrVal_770)))) (let ((.cse8 (select .cse11 .cse2))) (or (= 400 .cse7) (= 400 .cse8) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_772) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647)))))))) .cse0) (< .cse16 2147483647) (or .cse0 (forall ((v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_751 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_751) .cse5 .cse6)))) (let ((.cse26 (let ((.cse27 (select (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse18 (select .cse26 .cse2))) (let ((.cse24 (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse26 .cse12 v_ArrVal_758) .cse2 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse2) 4)) v_ArrVal_763)))) (let ((.cse22 (select .cse24 .cse2))) (let ((.cse21 (let ((.cse23 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse24 .cse12 v_ArrVal_764) .cse2 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse2) 4)) v_ArrVal_770)))) (let ((.cse17 (select .cse21 .cse2))) (or (= 400 .cse17) (= 400 .cse18) (< (select (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse12 v_ArrVal_772) .cse2 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647) (= 400 .cse22))))))))))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse30 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_764) .cse5 .cse6)))) (let ((.cse31 (let ((.cse32 (select (store .cse30 |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse28 (select .cse31 .cse2))) (or (= 400 .cse28) (< (select (let ((.cse29 (select (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse12 v_ArrVal_772) .cse2 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse29 (+ (* 4 (select .cse29 .cse2)) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647)))))) .cse0))))) is different from false [2023-12-02 20:51:27,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse28 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse21 (select .cse27 .cse28))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse27 .cse28 (+ .cse21 1)))) (.cse0 (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|))) (and (or .cse0 (forall ((v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse12 (let ((.cse13 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse2) 4)) v_ArrVal_755)))) (let ((.cse7 (select .cse12 .cse2))) (let ((.cse10 (let ((.cse11 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_758) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse8 (select .cse10 .cse2))) (let ((.cse4 (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_764) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) v_ArrVal_770)))) (let ((.cse6 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_772) .cse2 (+ 1 .cse6))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647) (= .cse7 400) (= 400 .cse8) (= 400 .cse6)))))))))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse19 (let ((.cse20 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse2)) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse17 (select .cse19 .cse2))) (let ((.cse15 (let ((.cse18 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse19 .cse5 v_ArrVal_764) .cse2 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse16 (select .cse15 .cse2))) (or (< (select (let ((.cse14 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_772) .cse2 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647) (= 400 .cse16) (= 400 .cse17))))))) .cse0) (< .cse21 2147483647) (or (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (select (let ((.cse22 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647)) .cse0) (or (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse25 (let ((.cse26 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse23 (select .cse25 .cse2))) (or (= 400 .cse23) (< (select (let ((.cse24 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse25 .cse5 v_ArrVal_772) .cse2 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647))))) .cse0))))) is different from false [2023-12-02 20:51:28,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse26 (select .cse3 .cse5))) (let ((.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ .cse26 1)) (.cse0 (= 400 .cse26))) (and (or .cse0 (forall ((v_ArrVal_772 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_772) .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647))) (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_755 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse16 (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_755)))) (let ((.cse12 (select .cse16 .cse2))) (let ((.cse14 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse10 v_ArrVal_758) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse7 (select .cse14 .cse2))) (let ((.cse9 (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse10 v_ArrVal_764) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse2) 4)) v_ArrVal_770)))) (let ((.cse11 (select .cse9 .cse2))) (or (= 400 .cse7) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_772) .cse2 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647) (= 400 .cse12) (= 400 .cse11))))))))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_758) .cse5 .cse6)))) (let ((.cse24 (let ((.cse25 (select (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse18 (select .cse24 .cse2))) (let ((.cse22 (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| (store (store .cse24 .cse10 v_ArrVal_764) .cse2 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* 4 (select .cse23 .cse2))) v_ArrVal_770)))) (let ((.cse19 (select .cse22 .cse2))) (or (= 400 .cse18) (= 400 .cse19) (< (select (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse10 v_ArrVal_772) .cse2 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647)))))))) .cse0) (< .cse26 2147483647) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse29 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_764) .cse5 .cse6)))) (let ((.cse30 (let ((.cse31 (select (store .cse29 |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse27 (select .cse30 .cse2))) (or (= 400 .cse27) (< (select (let ((.cse28 (select (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse10 v_ArrVal_772) .cse2 (+ .cse27 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse28 (+ (* 4 (select .cse28 .cse2)) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647)))))) .cse0))))) is different from false [2023-12-02 20:51:28,480 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse16 (select .cse3 .cse5))) (let ((.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ .cse16 1)) (.cse0 (= 400 .cse16))) (and (or .cse0 (forall ((v_ArrVal_772 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_772) .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_763 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_758 Int) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_758) .cse5 .cse6)))) (let ((.cse14 (let ((.cse15 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_761) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_763)))) (let ((.cse7 (select .cse14 .cse2))) (let ((.cse11 (let ((.cse13 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse14 .cse12 v_ArrVal_764) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse2))) v_ArrVal_770)))) (let ((.cse8 (select .cse11 .cse2))) (or (= 400 .cse7) (= 400 .cse8) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_772) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) v_ArrVal_777)) .cse2) 2147483647)))))))) .cse0) (< .cse16 2147483647) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_772 Int) (v_ArrVal_770 Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_764) .cse5 .cse6)))) (let ((.cse20 (let ((.cse21 (select (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_770)))) (let ((.cse17 (select .cse20 .cse2))) (or (= 400 .cse17) (< (select (let ((.cse18 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse12 v_ArrVal_772) .cse2 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|))) (store .cse18 (+ (* 4 (select .cse18 .cse2)) |c_~#queue~0.offset|) v_ArrVal_777)) .cse2) 2147483647)))))) .cse0))))) is different from false [2023-12-02 20:51:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:51:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:51:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:51:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:51:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 20:51:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 20:51:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:51:28,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:51:28,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 20:51:28,946 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-12-02 20:51:28,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:51:28,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1627000257, now seen corresponding path program 3 times [2023-12-02 20:51:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:51:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674008022] [2023-12-02 20:51:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:51:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:51:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:51:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:51:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:51:33,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674008022] [2023-12-02 20:51:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674008022] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:51:33,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706162891] [2023-12-02 20:51:33,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:51:33,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:51:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:51:33,896 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:51:33,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff84146-62b4-42f2-9eba-b409585c001d/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:51:36,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-02 20:51:36,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:51:36,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 223 conjunts are in the unsatisfiable core [2023-12-02 20:51:36,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:51:36,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:36,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:36,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:51:36,982 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-12-02 20:51:36,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 20:51:36,999 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 20:51:37,000 INFO L378 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 20 treesize of output 22 [2023-12-02 20:51:37,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:37,179 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:51:37,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2023-12-02 20:51:37,268 INFO L378 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 43 treesize of output 34 [2023-12-02 20:51:37,335 INFO L378 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 51 treesize of output 42 [2023-12-02 20:51:37,483 INFO L378 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 51 treesize of output 38 [2023-12-02 20:51:37,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:37,546 INFO L378 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 42 treesize of output 31 [2023-12-02 20:51:37,693 INFO L378 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 61 treesize of output 46 [2023-12-02 20:51:37,812 INFO L378 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 69 treesize of output 54 [2023-12-02 20:51:38,008 INFO L378 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 69 treesize of output 54 [2023-12-02 20:51:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:38,096 INFO L378 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 60 treesize of output 43 [2023-12-02 20:51:38,288 INFO L378 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 79 treesize of output 58 [2023-12-02 20:51:38,486 INFO L378 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 99 treesize of output 74 [2023-12-02 20:51:40,170 INFO L378 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 325 treesize of output 254 [2023-12-02 20:51:40,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:40,493 INFO L378 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 758 treesize of output 615 [2023-12-02 20:51:40,977 INFO L378 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 777 treesize of output 630 [2023-12-02 20:51:42,286 INFO L378 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 5895 treesize of output 4946 [2023-12-02 20:51:46,575 INFO L378 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 25286 treesize of output 20913 [2023-12-02 20:51:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:52,467 INFO L378 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 88182 treesize of output 72603 [2023-12-02 20:51:58,364 INFO L378 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 88201 treesize of output 72618 [2023-12-02 20:52:08,889 INFO L378 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 659584 treesize of output 532695 [2023-12-02 20:52:34,104 INFO L378 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 3074621 treesize of output 2469582 [2023-12-02 20:52:52,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:52:52,305 INFO L378 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 14422402 treesize of output 11572761 [2023-12-02 20:53:15,847 INFO L378 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 14422421 treesize of output 11572776 [2023-12-02 20:54:14,676 WARN L293 SmtUtils]: Spent 20.65s on a formula simplification. DAG size of input: 1900 DAG size of output: 1895 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:54:19,337 INFO L378 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 138913063 treesize of output 110127974 [2023-12-02 20:55:51,938 WARN L293 SmtUtils]: Spent 29.46s on a formula simplification. DAG size of input: 2244 DAG size of output: 2242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:57:23,782 WARN L293 SmtUtils]: Spent 28.43s on a formula simplification. DAG size of input: 2245 DAG size of output: 2242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:57:30,101 INFO L378 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 771834885 treesize of output 610861370 [2023-12-02 20:58:57,969 WARN L293 SmtUtils]: Spent 19.12s on a formula simplification. DAG size of input: 2438 DAG size of output: 2436 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:58:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:58:59,261 INFO L378 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 4320975973 treesize of output 3410330476 [2023-12-02 21:00:06,177 WARN L293 SmtUtils]: Spent 19.06s on a formula simplification. DAG size of input: 2434 DAG size of output: 2434 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)