./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F --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.3.0-dev-826ab2b [2024-11-13 12:18:23,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:18:23,489 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-13 12:18:23,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:18:23,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:18:23,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:18:23,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:18:23,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:18:23,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:18:23,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:18:23,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:18:23,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:18:23,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:18:23,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:18:23,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:18:23,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:18:23,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:18:23,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:18:23,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:18:23,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:18:23,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:18:23,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:18:23,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:18:23,545 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 12:18:23,545 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:18:23,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:18:23,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:18:23,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:18:23,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:18:23,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:18:23,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:18:23,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:18:23,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:18:23,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 12:18:23,547 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 12:18:23,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F 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 [2024-11-13 12:18:23,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:18:23,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:18:23,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:18:23,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:18:23,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:18:23,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/../../sv-benchmarks/c/pthread/queue_ok_longer.i Unable to find full path for "g++" [2024-11-13 12:18:26,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:18:26,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:18:26,529 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-13 12:18:26,561 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/data/e3065e8dc/4c4fe80e256440df91efaf83ecaa03fc/FLAG0fdf98cc3 [2024-11-13 12:18:26,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/data/e3065e8dc/4c4fe80e256440df91efaf83ecaa03fc [2024-11-13 12:18:26,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:18:26,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:18:26,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:18:26,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:18:26,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:18:26,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:18:26" (1/1) ... [2024-11-13 12:18:26,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3258f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:26, skipping insertion in model container [2024-11-13 12:18:26,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:18:26" (1/1) ... [2024-11-13 12:18:26,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:18:27,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:18:27,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:18:27,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:18:27,590 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:18:27,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27 WrapperNode [2024-11-13 12:18:27,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:18:27,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:18:27,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:18:27,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:18:27,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,755 INFO L138 Inliner]: procedures = 277, calls = 857, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1014 [2024-11-13 12:18:27,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:18:27,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:18:27,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:18:27,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:18:27,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:18:27,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:18:27,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:18:27,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:18:27,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (1/1) ... [2024-11-13 12:18:27,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:18:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:18:27,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 12:18:27,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 12:18:28,025 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-13 12:18:28,026 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-13 12:18:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-13 12:18:28,026 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-13 12:18:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 12:18:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 12:18:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 12:18:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 12:18:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 12:18:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:18:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 12:18:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:18:28,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:18:28,029 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:18:28,253 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:18:28,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:18:30,335 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:18:30,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:18:39,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:18:39,426 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:18:39,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:18:39 BoogieIcfgContainer [2024-11-13 12:18:39,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:18:39,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:18:39,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:18:39,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:18:39,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:18:26" (1/3) ... [2024-11-13 12:18:39,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64342c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:18:39, skipping insertion in model container [2024-11-13 12:18:39,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:18:27" (2/3) ... [2024-11-13 12:18:39,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64342c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:18:39, skipping insertion in model container [2024-11-13 12:18:39,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:18:39" (3/3) ... [2024-11-13 12:18:39,442 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-11-13 12:18:39,466 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:18:39,469 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2024-11-13 12:18:39,469 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:18:39,625 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 12:18:39,707 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:18:39,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 12:18:39,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:18:39,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 12:18:39,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 12:18:39,766 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:18:39,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-13 12:18:39,795 INFO L333 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, 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;@60020da1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:18:39,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-13 12:18:40,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:18:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:18:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2129818058, now seen corresponding path program 1 times [2024-11-13 12:18:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:18:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113355322] [2024-11-13 12:18:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:18:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:18:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:18:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:18:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:18:42,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113355322] [2024-11-13 12:18:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113355322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:18:42,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:18:42,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:18:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736337064] [2024-11-13 12:18:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:18:42,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:18:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:18:42,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:18:42,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:18:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:42,094 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:18:42,097 INFO L472 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) [2024-11-13 12:18:42,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:18:42,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:18:42,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:18:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -719152954, now seen corresponding path program 1 times [2024-11-13 12:18:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:18:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249903555] [2024-11-13 12:18:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:18:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:18:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:18:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:18:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:18:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249903555] [2024-11-13 12:18:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249903555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:18:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:18:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:18:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208031285] [2024-11-13 12:18:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:18:44,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:18:44,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:18:44,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:18:44,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:18:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:44,806 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:18:44,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2024-11-13 12:18:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:44,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:45,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:18:45,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:18:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:18:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash -818902865, now seen corresponding path program 1 times [2024-11-13 12:18:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:18:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64916939] [2024-11-13 12:18:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:18:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:18:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:18:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:18:47,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:18:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64916939] [2024-11-13 12:18:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64916939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:18:47,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:18:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:18:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517166931] [2024-11-13 12:18:47,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:18:47,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:18:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:18:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:18:47,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:18:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:47,762 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:18:47,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-11-13 12:18:47,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:47,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:47,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:48,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:48,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:18:48,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:18:48,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:18:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash -986566734, now seen corresponding path program 1 times [2024-11-13 12:18:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:18:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343429047] [2024-11-13 12:18:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:18:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:18:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:18:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:18:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:18:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343429047] [2024-11-13 12:18:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343429047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:18:50,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:18:50,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:18:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635611317] [2024-11-13 12:18:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:18:50,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:18:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:18:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:18:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:18:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:50,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:18:50,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2024-11-13 12:18:50,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:50,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:50,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:50,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:18:51,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:18:51,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:18:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:18:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash -346145778, now seen corresponding path program 1 times [2024-11-13 12:18:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:18:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480206667] [2024-11-13 12:18:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:18:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:18:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:18:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:18:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:18:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480206667] [2024-11-13 12:18:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480206667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:18:51,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:18:51,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:18:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350675187] [2024-11-13 12:18:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:18:51,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:18:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:18:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:18:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:18:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:51,968 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:18:51,968 INFO L472 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) [2024-11-13 12:18:51,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:51,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:51,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:51,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:18:51,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:18:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:52,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:18:52,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:18:52,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:18:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash 189829078, now seen corresponding path program 1 times [2024-11-13 12:18:52,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:18:52,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855107030] [2024-11-13 12:18:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:18:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:18:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:18:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:18:56,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:18:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855107030] [2024-11-13 12:18:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855107030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:18:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957470981] [2024-11-13 12:18:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:18:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:18:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:18:56,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:18:56,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:18:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:18:56,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 12:18:56,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:18:56,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2024-11-13 12:18:57,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:18:57,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:18:57,118 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-13 12:18:57,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-13 12:18:57,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:18:57,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2024-11-13 12:18:57,457 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 38 treesize of output 16 [2024-11-13 12:18:57,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:18:57,518 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 27 treesize of output 20 [2024-11-13 12:18:57,596 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 41 treesize of output 33 [2024-11-13 12:18:57,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:18:57,603 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 43 treesize of output 23 [2024-11-13 12:18:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:18:57,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:18:57,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (< 0 (+ (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_265) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) (+ 1608 |c_~#queue~0.offset|)) 2147483650))) is different from false [2024-11-13 12:18:57,876 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20| 1))) |c_~#stored_elements~0.base| v_ArrVal_265) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) (+ 1608 |c_~#queue~0.offset|)))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20|)))) is different from false [2024-11-13 12:18:57,906 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< 0 (+ 2147483650 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20| 1))) |c_~#stored_elements~0.base| v_ArrVal_265) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) (+ 1608 |c_~#queue~0.offset|)))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20|)))) is different from false [2024-11-13 12:18:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-13 12:18:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957470981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:18:58,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:18:58,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-11-13 12:18:58,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079820930] [2024-11-13 12:18:58,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:18:58,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 12:18:58,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:18:58,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 12:18:58,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=265, Unknown=7, NotChecked=108, Total=462 [2024-11-13 12:18:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:18:58,410 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:18:58,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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) [2024-11-13 12:18:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:18:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:18:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:18:58,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:00,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_265 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20| 1))) |c_~#stored_elements~0.base| v_ArrVal_265) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) .cse4))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_20|)))) (forall ((v_ArrVal_265 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (< 0 (+ 2147483650 (select (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_265) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) .cse4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (< 0 (+ 2147483650 (select (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) .cse4)))))) is different from false [2024-11-13 12:19:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:19:00,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:19:00,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:00,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:00,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1589736351, now seen corresponding path program 1 times [2024-11-13 12:19:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834480226] [2024-11-13 12:19:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:00,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834480226] [2024-11-13 12:19:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834480226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:19:03,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766052607] [2024-11-13 12:19:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:03,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:03,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:19:03,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:19:03,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:19:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:04,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 12:19:04,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:19:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2024-11-13 12:19:04,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:04,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:19:04,475 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-13 12:19:04,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-13 12:19:04,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:19:04,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2024-11-13 12:19:04,779 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 38 treesize of output 16 [2024-11-13 12:19:04,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:04,830 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 27 treesize of output 20 [2024-11-13 12:19:04,894 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 41 treesize of output 33 [2024-11-13 12:19:04,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:19:04,900 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 43 treesize of output 23 [2024-11-13 12:19:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:04,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:19:05,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (v_ArrVal_373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| 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_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_373) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|)))) is different from false [2024-11-13 12:19:05,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (v_ArrVal_373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| 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|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_373) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|)))) is different from false [2024-11-13 12:19:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 12:19:05,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766052607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:19:05,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:19:05,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-11-13 12:19:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877323756] [2024-11-13 12:19:05,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:19:05,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 12:19:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 12:19:05,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=8, NotChecked=74, Total=462 [2024-11-13 12:19:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:05,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:05,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 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) [2024-11-13 12:19:05,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:05,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:05,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:05,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:05,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:05,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:19:05,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:06,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_23| Int)) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_23| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_373) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) .cse3) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_23|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (v_ArrVal_373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_373) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) .cse3) 2147483647) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|)))))) is different from false [2024-11-13 12:19:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:19:06,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:19:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:07,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1271652702, now seen corresponding path program 1 times [2024-11-13 12:19:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509332080] [2024-11-13 12:19:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:09,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509332080] [2024-11-13 12:19:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509332080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:19:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793887465] [2024-11-13 12:19:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:09,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:09,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:19:09,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:19:09,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:19:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:10,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 1905 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 12:19:10,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:19:10,068 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 35 treesize of output 9 [2024-11-13 12:19:10,166 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:19:10,184 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 12:19:10,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-11-13 12:19:10,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:10,273 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 29 treesize of output 13 [2024-11-13 12:19:10,475 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 29 treesize of output 3 [2024-11-13 12:19:10,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:10,559 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 29 treesize of output 22 [2024-11-13 12:19:10,660 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 12:19:10,660 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 56 treesize of output 40 [2024-11-13 12:19:10,704 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 40 treesize of output 18 [2024-11-13 12:19:10,714 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 30 treesize of output 12 [2024-11-13 12:19:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:10,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:19:10,839 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_493 (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_493) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) .cse1))))) is different from false [2024-11-13 12:19:10,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_493 (Array Int Int))) (< 0 (+ 2147483650 (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_493) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) .cse1))))) is different from false [2024-11-13 12:19:10,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_493 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| 1))) |c_~#stored_elements~0.base| v_ArrVal_493) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) .cse1)))) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| 2147483649) 0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33|)))) is different from false [2024-11-13 12:19:10,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_493 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< 0 (+ (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|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| 1))) |c_~#stored_elements~0.base| v_ArrVal_493) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) .cse1)) 2147483650)) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| 2147483649) 0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33|)))) is different from false [2024-11-13 12:19:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-13 12:19:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793887465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:19:11,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:19:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 23 [2024-11-13 12:19:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101480957] [2024-11-13 12:19:11,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:19:11,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 12:19:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:11,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 12:19:11,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=325, Unknown=4, NotChecked=164, Total=600 [2024-11-13 12:19:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:11,304 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:11,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:19:11,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:11,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:11,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:11,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:11,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:11,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:11,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:19:11,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:19:12,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:19:12,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 12:19:12,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:12,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -766525862, now seen corresponding path program 1 times [2024-11-13 12:19:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:12,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107428383] [2024-11-13 12:19:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:12,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:15,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:15,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107428383] [2024-11-13 12:19:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107428383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:19:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175761960] [2024-11-13 12:19:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:15,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:15,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:19:15,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:19:15,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:19:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:15,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 12:19:15,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:19:16,002 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 35 treesize of output 9 [2024-11-13 12:19:16,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:19:16,161 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 12:19:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-11-13 12:19:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:16,227 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 29 treesize of output 13 [2024-11-13 12:19:16,356 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 29 treesize of output 3 [2024-11-13 12:19:16,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:16,391 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 [2024-11-13 12:19:16,453 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 12:19:16,453 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 [2024-11-13 12:19:16,485 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 29 treesize of output 13 [2024-11-13 12:19:16,493 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 19 treesize of output 7 [2024-11-13 12:19:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:16,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:19:16,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_614) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse1)) 2147483647)) is different from false [2024-11-13 12:19:16,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| 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_614) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse1)) 2147483647)) is different from false [2024-11-13 12:19:16,650 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_614 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40|) (< (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 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_614) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse3)) 2147483647))))) is different from false [2024-11-13 12:19:16,680 WARN L851 $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_614 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40|) (< (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|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_614) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse2)) 2147483647)))))) is different from false [2024-11-13 12:19:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-13 12:19:17,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175761960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:19:17,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:19:17,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2024-11-13 12:19:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632820295] [2024-11-13 12:19:17,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:19:17,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 12:19:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 12:19:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=271, Unknown=4, NotChecked=156, Total=552 [2024-11-13 12:19:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:17,022 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:17,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:19:17,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:18,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647) (forall ((v_ArrVal_614 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_21| Int)) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40| 1))) |c_~#stored_elements~0.base| v_ArrVal_614) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse1) 2147483647) (= 400 .cse3) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_40|))))) (forall ((v_ArrVal_614 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int)) (< (select (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_614) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse1) 2147483647)))) is different from false [2024-11-13 12:19:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:19:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:18,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:19:18,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 12:19:18,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:18,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2103093022, now seen corresponding path program 1 times [2024-11-13 12:19:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:18,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138333254] [2024-11-13 12:19:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:18,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138333254] [2024-11-13 12:19:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138333254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:19:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169421828] [2024-11-13 12:19:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:19:19,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:19:19,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:19:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:20,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:19:20,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:19:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:20,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:19:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169421828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:19:20,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:19:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-13 12:19:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900839159] [2024-11-13 12:19:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:19:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:19:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:20,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:19:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:19:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:20,145 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:20,145 INFO L472 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) [2024-11-13 12:19:20,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:20,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:20,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:20,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:20,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:20,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:19:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:20,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:20,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 12:19:21,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 12:19:21,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash 771376482, now seen corresponding path program 1 times [2024-11-13 12:19:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880974979] [2024-11-13 12:19:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:19:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880974979] [2024-11-13 12:19:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880974979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:19:21,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:19:21,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:19:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23297550] [2024-11-13 12:19:21,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:19:21,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:19:21,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:21,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:19:21,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:19:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:21,257 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:21,257 INFO L472 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) [2024-11-13 12:19:21,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:21,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:21,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:21,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:21,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:21,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:19:21,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:21,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:19:21,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:19:21,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:21,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:19:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:19:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:19:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:19:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:22,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:19:22,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:22,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1134305834, now seen corresponding path program 2 times [2024-11-13 12:19:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754814630] [2024-11-13 12:19:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 12:19:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754814630] [2024-11-13 12:19:24,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754814630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:19:24,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449348863] [2024-11-13 12:19:24,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:19:24,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:24,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:19:24,048 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:19:24,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:19:24,975 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:19:24,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:19:24,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 2060 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 12:19:24,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:19:25,197 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 19 treesize of output 1 [2024-11-13 12:19:25,278 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 31 treesize of output 15 [2024-11-13 12:19:25,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:25,320 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 20 treesize of output 15 [2024-11-13 12:19:25,370 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 34 treesize of output 28 [2024-11-13 12:19:25,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:19:25,378 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 38 treesize of output 22 [2024-11-13 12:19:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 12:19:25,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:19:25,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int)) (or (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_23| 2147483648) 0) (< 0 (+ (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1019) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2024-11-13 12:19:25,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (or (< 0 (+ (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 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1019) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_23| 2147483648) 0))) is different from false [2024-11-13 12:19:25,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:19:25,598 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 68 treesize of output 55 [2024-11-13 12:19:25,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:19:25,614 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 66 treesize of output 68 [2024-11-13 12:19:25,624 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 [2024-11-13 12:19:25,639 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 10 treesize of output 6 [2024-11-13 12:19:25,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:19:25,668 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 52 treesize of output 54 [2024-11-13 12:19:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-11-13 12:19:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449348863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:19:25,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:19:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2024-11-13 12:19:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239716787] [2024-11-13 12:19:25,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:19:25,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 12:19:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 12:19:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=256, Unknown=2, NotChecked=70, Total=420 [2024-11-13 12:19:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:25,930 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:25,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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) [2024-11-13 12:19:25,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:25,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:25,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:19:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:19:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:19:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:19:26,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:19:26,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 12:19:26,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:26,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash -803740257, now seen corresponding path program 2 times [2024-11-13 12:19:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:26,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116277971] [2024-11-13 12:19:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116277971] [2024-11-13 12:19:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116277971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:19:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749486598] [2024-11-13 12:19:32,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:19:32,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:32,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:19:32,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:19:32,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:19:34,567 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:19:34,567 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:19:34,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-13 12:19:34,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:19:34,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-13 12:19:34,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 12:19:34,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 43 treesize of output 23 [2024-11-13 12:19:35,047 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 30 treesize of output 14 [2024-11-13 12:19:35,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:35,090 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 23 treesize of output 16 [2024-11-13 12:19:35,182 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-13 12:19:35,182 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-13 12:19:35,305 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 43 treesize of output 23 [2024-11-13 12:19:35,469 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 43 treesize of output 23 [2024-11-13 12:19:35,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:35,530 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 23 treesize of output 16 [2024-11-13 12:19:35,613 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-13 12:19:35,614 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-13 12:19:35,726 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 43 treesize of output 23 [2024-11-13 12:19:35,941 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 43 treesize of output 23 [2024-11-13 12:19:36,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:36,001 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 23 treesize of output 16 [2024-11-13 12:19:36,080 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 31 treesize of output 23 [2024-11-13 12:19:36,082 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 33 treesize of output 23 [2024-11-13 12:19:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:36,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:19:36,190 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_1231 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2024-11-13 12:19:36,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int 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_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|)))) is different from false [2024-11-13 12:19:36,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int 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|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|)))) is different from false [2024-11-13 12:19:36,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|))))) is different from false [2024-11-13 12:19:36,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))))) (let ((.cse0 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|)))))) is different from false [2024-11-13 12:19:36,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|)))))) is different from false [2024-11-13 12:19:37,505 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (v_ArrVal_1223 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|)))))) is different from false [2024-11-13 12:19:37,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (v_ArrVal_1223 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (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 ((.cse5 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|)))))) is different from false [2024-11-13 12:19:37,740 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (v_ArrVal_1223 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse7 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66|) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|))))))) is different from false [2024-11-13 12:19:37,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (v_ArrVal_1223 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |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|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| 1))))) (let ((.cse5 (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66|) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|))))))) is different from false [2024-11-13 12:19:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 2 times theorem prover too weak. 0 trivial. 22 not checked. [2024-11-13 12:19:40,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749486598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:19:40,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:19:40,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 46 [2024-11-13 12:19:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259423635] [2024-11-13 12:19:40,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:19:40,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-13 12:19:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:40,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-13 12:19:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1067, Unknown=13, NotChecked=810, Total=2256 [2024-11-13 12:19:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:40,954 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:40,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 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) [2024-11-13 12:19:40,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:40,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:40,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:40,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:40,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:19:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:44,005 WARN L851 $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 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse2 .cse3)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (v_ArrVal_1223 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| 1))))) (let ((.cse9 (let ((.cse11 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_55| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse14 (let ((.cse18 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse13 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_55| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66| 1))) |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse12 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse12 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select .cse13 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_66|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse14 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_55|)))))) (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))))) (let ((.cse19 (let ((.cse22 (select (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| (store (store .cse19 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse19 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|)))))))) is different from false [2024-11-13 12:19:44,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (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|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (v_ArrVal_1223 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse5 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse3 (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_1231 (Array Int Int))) (< (select (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647)) (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse9 (let ((.cse11 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647)))))) is different from false [2024-11-13 12:19:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:19:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 12:19:44,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:19:44,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:44,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:19:44,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:19:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash 699797666, now seen corresponding path program 2 times [2024-11-13 12:19:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:19:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724404038] [2024-11-13 12:19:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:19:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:19:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:19:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 12:19:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:19:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724404038] [2024-11-13 12:19:46,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724404038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:19:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066045713] [2024-11-13 12:19:46,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:19:46,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:19:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:19:46,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:19:46,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:19:47,548 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:19:47,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:19:47,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-13 12:19:47,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:19:47,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-13 12:19:47,704 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 23 treesize of output 11 [2024-11-13 12:19:47,781 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 23 treesize of output 11 [2024-11-13 12:19:47,883 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 23 treesize of output 3 [2024-11-13 12:19:47,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:47,919 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 16 treesize of output 11 [2024-11-13 12:19:47,972 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:19:47,973 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 35 treesize of output 29 [2024-11-13 12:19:48,047 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 23 treesize of output 11 [2024-11-13 12:19:48,149 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 36 treesize of output 13 [2024-11-13 12:19:48,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:48,191 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 16 treesize of output 11 [2024-11-13 12:19:48,244 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:19:48,244 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 35 treesize of output 29 [2024-11-13 12:19:48,328 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 23 treesize of output 11 [2024-11-13 12:19:48,544 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 36 treesize of output 13 [2024-11-13 12:19:48,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:19:48,607 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 18 [2024-11-13 12:19:48,706 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:19:48,706 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 44 treesize of output 34 [2024-11-13 12:19:48,776 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 32 treesize of output 16 [2024-11-13 12:19:48,788 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 24 treesize of output 12 [2024-11-13 12:19:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:19:48,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:19:48,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1455 (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_1455) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1))))) is different from false [2024-11-13 12:19:49,075 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1)))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0)))) is different from false [2024-11-13 12:19:49,099 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< 0 (+ 2147483650 (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse3)))) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0)))) is different from false [2024-11-13 12:19:49,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_1451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1451) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0) (< 0 (+ 2147483650 (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1))))))) is different from false [2024-11-13 12:19:49,326 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_1451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (let ((.cse4 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1451) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< 0 (+ 2147483650 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1))) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0))))) is different from false [2024-11-13 12:19:49,394 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_1451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1451) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|)))))) is different from false [2024-11-13 12:19:49,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_1451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1451) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< 0 (+ 2147483650 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1)))))))) is different from false [2024-11-13 12:19:49,868 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| Int) (v_ArrVal_1447 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_1451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1447) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_1451) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< 0 (+ (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1) 2147483650)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0)))))) is different from false [2024-11-13 12:19:52,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| Int) (v_ArrVal_1447 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_1451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_81| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_81| 1))))) (let ((.cse2 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1447) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_1451) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0) (< 0 (+ 2147483650 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1))) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_81|))))))) is different from false [2024-11-13 12:19:52,260 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| Int) (v_ArrVal_1447 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1455 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_1451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_81| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_68| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_81| 1))))) (let ((.cse5 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1447) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_68| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_1451) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (or (< 0 (+ (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 1))) |c_~#stored_elements~0.base| v_ArrVal_1455) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1) 2147483650)) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75| 2147483649) 0) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_81|))))))) is different from false [2024-11-13 12:19:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 26 not checked. [2024-11-13 12:19:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066045713] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:19:53,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:19:53,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 19] total 41 [2024-11-13 12:19:53,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095939822] [2024-11-13 12:19:53,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:19:53,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 12:19:53,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:19:53,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 12:19:53,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=834, Unknown=21, NotChecked=710, Total=1806 [2024-11-13 12:19:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:53,333 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:19:53,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 42 states have internal predecessors, (122), 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) [2024-11-13 12:19:53,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:19:53,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:53,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:53,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:19:53,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:53,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:19:53,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:19:53,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:19:53,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:19:53,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:19:53,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:19:53,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:19:53,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 12:19:53,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:19:56,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_1231 (Array Int Int))) (< (select (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (v_ArrVal_1223 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse8 (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1223) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse7 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|))))))) is different from false [2024-11-13 12:19:57,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse15 .cse3)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store .cse15 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| Int) (v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse7 (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_53|) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))))) (let ((.cse11 (let ((.cse14 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse11 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* 4 (select .cse12 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|)))))))) is different from false [2024-11-13 12:19:58,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse10 .cse3)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646) (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))))) (let ((.cse6 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|)))))))) is different from false [2024-11-13 12:19:58,039 WARN L851 $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 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse2 .cse3)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|))) (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))))) (let ((.cse6 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|)))))))) is different from false [2024-11-13 12:19:58,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (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|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_1231 (Array Int Int))) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)) (forall ((v_ArrVal_1227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse4 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1227) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|) (< (select (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse4 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)))))) is different from false [2024-11-13 12:19:59,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_51|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646))) is different from false [2024-11-13 12:20:00,156 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_1231 (Array Int 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|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:20:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-13 12:20:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 12:20:00,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 12:20:00,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:20:00,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:20:00,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:20:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2056313434, now seen corresponding path program 2 times [2024-11-13 12:20:00,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:20:00,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25739144] [2024-11-13 12:20:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:20:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:20:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:20:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:20:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:20:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25739144] [2024-11-13 12:20:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25739144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:20:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193880251] [2024-11-13 12:20:07,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:20:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:20:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:20:07,187 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:20:07,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:20:08,428 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:20:08,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:20:08,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 2258 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-13 12:20:08,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:20:08,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-13 12:20:08,617 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 23 treesize of output 11 [2024-11-13 12:20:08,683 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 23 treesize of output 11 [2024-11-13 12:20:08,798 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 23 treesize of output 3 [2024-11-13 12:20:08,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:20:08,842 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 16 treesize of output 11 [2024-11-13 12:20:08,887 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:20:08,888 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 35 treesize of output 29 [2024-11-13 12:20:08,972 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 23 treesize of output 11 [2024-11-13 12:20:09,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 36 treesize of output 13 [2024-11-13 12:20:09,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:20:09,130 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 16 treesize of output 11 [2024-11-13 12:20:09,173 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:20:09,174 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 35 treesize of output 29 [2024-11-13 12:20:09,263 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 23 treesize of output 11 [2024-11-13 12:20:09,398 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 25 treesize of output 13 [2024-11-13 12:20:09,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:20:09,480 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 16 treesize of output 11 [2024-11-13 12:20:09,558 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:20:09,558 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 35 treesize of output 29 [2024-11-13 12:20:09,673 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 23 treesize of output 11 [2024-11-13 12:20:09,900 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 25 treesize of output 13 [2024-11-13 12:20:09,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:20:09,962 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 16 treesize of output 11 [2024-11-13 12:20:10,024 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:20:10,024 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 35 treesize of output 29 [2024-11-13 12:20:10,114 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 23 treesize of output 11 [2024-11-13 12:20:10,282 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 25 treesize of output 13 [2024-11-13 12:20:10,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:20:10,329 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 16 treesize of output 11 [2024-11-13 12:20:10,402 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:20:10,403 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 35 treesize of output 29 [2024-11-13 12:20:10,455 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 23 treesize of output 11 [2024-11-13 12:20:10,465 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 15 treesize of output 7 [2024-11-13 12:20:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:20:10,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:20:10,768 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| 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_1784) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1)) 2147483647)) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-13 12:20:11,039 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647)))))) is different from false [2024-11-13 12:20:11,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse2 (+ |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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse4 (let ((.cse5 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 400) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647)))))) is different from false [2024-11-13 12:20:11,271 WARN L851 $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_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (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|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse0 1))))) (let ((.cse4 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (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_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse5))))))))) is different from false [2024-11-13 12:20:11,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse7 .cse1))) (let ((.cse2 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647) (= .cse4 400) (= 400 .cse5)))))))) is different from false [2024-11-13 12:20:11,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse2 (+ |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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse8 (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse8 .cse2))) (let ((.cse4 (let ((.cse7 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse8 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse6 (select .cse4 .cse2))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ 1 .cse6))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse6)))))))) is different from false [2024-11-13 12:20:11,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse11 .cse12))) (or (= 400 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse12 (+ .cse0 1))))) (let ((.cse9 (let ((.cse10 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse9 .cse3))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse9 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 400 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse3) 2147483647) (= 400 .cse7))))))))))) is different from false [2024-11-13 12:20:12,414 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (let ((.cse11 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse10 .cse1))) (let ((.cse8 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse6 (select .cse8 .cse1))) (let ((.cse2 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647) (= 400 .cse4) (= 400 .cse5) (= .cse6 400)))))))))) is different from false [2024-11-13 12:20:12,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| 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_1772) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse11 .cse3))) (let ((.cse9 (let ((.cse10 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse11 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse1 (select .cse9 .cse3))) (let ((.cse5 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse9 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse7 (select .cse5 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse3) 2147483647) (= 400 .cse7)))))))))) is different from false [2024-11-13 12:20:12,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))))) (let ((.cse13 (let ((.cse14 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse6) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select .cse13 .cse6))) (let ((.cse11 (let ((.cse12 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse13 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse6) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse0 (select .cse11 .cse6))) (let ((.cse8 (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse6) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse1 (select .cse8 .cse6))) (or (= .cse0 400) (= 400 .cse1) (= 400 .cse2) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse6))) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse6) 2147483647))))))))))) is different from false [2024-11-13 12:20:12,689 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))))) (let ((.cse13 (let ((.cse14 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (select .cse13 .cse3))) (let ((.cse11 (let ((.cse12 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse13 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse1 (select .cse11 .cse3))) (let ((.cse5 (let ((.cse10 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse11 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse0 (select .cse5 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse3) 2147483647) (< (select .cse7 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (= 400 .cse9))))))))))) is different from false [2024-11-13 12:20:13,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1768) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse1 (select .cse11 .cse3))) (let ((.cse9 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse0 (select .cse9 .cse3))) (let ((.cse5 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse7 (select .cse5 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse3) 2147483647) (= 400 .cse7))))))))))) is different from false [2024-11-13 12:20:13,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))))) (let ((.cse10 (let ((.cse16 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1768) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse14 (let ((.cse15 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse10 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse7 (select .cse14 .cse1))) (let ((.cse12 (let ((.cse13 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse14 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse6 (select .cse12 .cse1))) (let ((.cse3 (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse12 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647) (= 400 .cse6) (= 400 .cse7) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (= 400 .cse5)))))))))))) is different from false [2024-11-13 12:20:14,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_90| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))))) (let ((.cse1 (let ((.cse16 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1768) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse14 (let ((.cse15 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_90| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse7 (select .cse14 .cse2))) (let ((.cse12 (let ((.cse13 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse14 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse8 (select .cse12 .cse2))) (let ((.cse5 (let ((.cse11 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse12 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse0 (select .cse5 .cse2))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse7) (= 400 .cse8) (< (select .cse9 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|)))))))))))) is different from false [2024-11-13 12:20:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 43 refuted. 3 times theorem prover too weak. 0 trivial. 74 not checked. [2024-11-13 12:20:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193880251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:20:15,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:20:15,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 28] total 68 [2024-11-13 12:20:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935542538] [2024-11-13 12:20:15,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:20:15,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-13 12:20:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:20:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-13 12:20:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=852, Invalid=2222, Unknown=62, NotChecked=1694, Total=4830 [2024-11-13 12:20:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:20:15,883 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:20:15,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.6231884057971016) internal successors, (181), 69 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) [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:20:15,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:20:15,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:15,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:20:15,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-13 12:20:15,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-13 12:20:15,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:20:20,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse37 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse38 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse37 .cse38)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse8 (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse6 (select .cse8 .cse2))) (let ((.cse3 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse5 (select .cse3 .cse2))) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= .cse5 400) (= 400 .cse6))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse18 (let ((.cse19 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse13 (select .cse18 .cse2))) (let ((.cse16 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse18 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse14 (select .cse16 .cse2))) (let ((.cse11 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse12 (select .cse11 .cse2))) (or (< (select (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse12) (= 400 .cse13) (= .cse14 400))))))))) (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse22 (let ((.cse31 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1768) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)))) (let ((.cse29 (let ((.cse30 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse21 (select .cse29 .cse2))) (let ((.cse27 (let ((.cse28 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse29 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse20 (select .cse27 .cse2))) (let ((.cse24 (let ((.cse26 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse27 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse20 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse25 (select .cse24 .cse2))) (or (= 400 .cse20) (= 400 .cse21) (< (select .cse22 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (select (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse24 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse25 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse25)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse34 (let ((.cse35 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse32 (select .cse34 .cse2))) (or (= 400 .cse32) (< (select (let ((.cse33 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse34 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647))))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int)) (< (select (let ((.cse36 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse37 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse38 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse36 (+ (* (select .cse36 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647)) (= 400 .cse0)) (forall ((v_ArrVal_1768 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_57| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_90| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse41 (let ((.cse52 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse52 (+ (* (select .cse52 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_57|)))) (let ((.cse45 (let ((.cse51 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse41 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104| 1))) |c_~#stored_elements~0.base| v_ArrVal_1768) |c_~#queue~0.base|))) (store .cse51 (+ (* (select .cse51 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)))) (let ((.cse49 (let ((.cse50 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse45 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_90| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse50 (+ |c_~#queue~0.offset| (* (select .cse50 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse39 (select .cse49 .cse2))) (let ((.cse47 (let ((.cse48 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse49 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ .cse39 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse48 (+ (* (select .cse48 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse40 (select .cse47 .cse2))) (let ((.cse43 (let ((.cse46 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse47 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse40 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse46 (+ |c_~#queue~0.offset| (* (select .cse46 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse44 (select .cse43 .cse2))) (or (= 400 .cse39) (= 400 .cse40) (< (select .cse41 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_104|) (< (select (let ((.cse42 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse43 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse44 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse42 (+ |c_~#queue~0.offset| (* (select .cse42 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse44) (< (select .cse45 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|)))))))))))))) is different from false [2024-11-13 12:20:21,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse17 (select .cse8 .cse10))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (+ .cse17 1)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (= 400 .cse17))) (and (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse4 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse6 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse6))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))))) (let ((.cse22 (let ((.cse23 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse18 (select .cse22 .cse2))) (let ((.cse20 (let ((.cse21 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse22 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse13 (select .cse20 .cse2))) (let ((.cse16 (let ((.cse19 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse20 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse12 (select .cse16 .cse2))) (or (= 400 .cse12) (= 400 .cse13) (< (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (= 400 .cse18)))))))))) (< .cse17 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_55| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse29 (let ((.cse35 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse35 (+ (* (select .cse35 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_55|)))) (let ((.cse33 (let ((.cse34 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse29 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))) |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* (select .cse34 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse27 (select .cse33 .cse2))) (let ((.cse31 (let ((.cse32 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse33 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ .cse27 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse32 (+ (* 4 (select .cse32 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse28 (select .cse31 .cse2))) (let ((.cse25 (let ((.cse30 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse31 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse26 (select .cse25 .cse2))) (or (< (select (let ((.cse24 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse25 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse27) (= .cse28 400) (< (select .cse29 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (= 400 .cse26)))))))))) (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse38 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse42 (let ((.cse43 (select (store .cse38 |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse43 (+ |c_~#queue~0.offset| (* (select .cse43 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse40 (select .cse42 .cse2))) (let ((.cse39 (let ((.cse41 (select (store (store .cse38 |c_~#queue~0.base| (store (store .cse42 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse40 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse41 (+ |c_~#queue~0.offset| (* (select .cse41 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse36 (select .cse39 .cse2))) (or (= 400 .cse36) (< (select (let ((.cse37 (select (store (store .cse38 |c_~#queue~0.base| (store (store .cse39 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse36 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse37 (+ |c_~#queue~0.offset| (* (select .cse37 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse40))))))))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int)) (< (select (let ((.cse44 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse44 (+ (* (select .cse44 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647)) .cse0))))) is different from false [2024-11-13 12:20:21,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse17 (select .cse8 .cse10))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (+ .cse17 1)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (= 400 .cse17))) (and (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse4 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse6 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse6))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))))) (let ((.cse22 (let ((.cse23 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse18 (select .cse22 .cse2))) (let ((.cse20 (let ((.cse21 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse22 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse13 (select .cse20 .cse2))) (let ((.cse16 (let ((.cse19 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse20 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse12 (select .cse16 .cse2))) (or (= 400 .cse12) (= 400 .cse13) (< (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (= 400 .cse18)))))))))) (< .cse17 2147483647) (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse26 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse30 (let ((.cse31 (select (store .cse26 |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse31 (+ |c_~#queue~0.offset| (* (select .cse31 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse28 (select .cse30 .cse2))) (let ((.cse27 (let ((.cse29 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse30 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse24 (select .cse27 .cse2))) (or (= 400 .cse24) (< (select (let ((.cse25 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse24 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse28))))))))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int)) (< (select (let ((.cse32 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647)) .cse0))))) is different from false [2024-11-13 12:20:21,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse29 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse15 (select .cse28 .cse29))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse28 .cse29 (+ .cse15 1)))) (.cse10 (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse8 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse6 (select .cse8 .cse1))) (let ((.cse3 (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647) (= .cse6 400) (= 400 .cse5))))))) .cse10) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse12 (let ((.cse14 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse13 (select .cse12 .cse1))) (or (< (select (let ((.cse11 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse12 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647) (= 400 .cse13))))) .cse10) (< .cse15 2147483647) (or (forall ((v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int)) (< (select (let ((.cse16 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647)) .cse10) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse28 .cse29 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101| 1))))) (let ((.cse26 (let ((.cse27 (select (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse19 (select .cse26 .cse1))) (let ((.cse24 (let ((.cse25 (select (store (store .cse21 |c_~#queue~0.base| (store (store .cse26 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse17 (select .cse24 .cse1))) (let ((.cse22 (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| (store (store .cse24 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse18 (select .cse22 .cse1))) (or (= .cse17 400) (= 400 .cse18) (= 400 .cse19) (< .cse15 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_101|) (< (select (let ((.cse20 (select (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse1 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* 4 (select .cse20 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647)))))))))))))) is different from false [2024-11-13 12:20:22,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse7 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse5 (select .cse7 .cse1))) (let ((.cse2 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647) (= .cse4 400) (= 400 .cse5))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1772 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse17 (let ((.cse18 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1772) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse12 (select .cse17 .cse1))) (let ((.cse15 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse17 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse13 (select .cse15 .cse1))) (let ((.cse10 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse11 (select .cse10 .cse1))) (or (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647) (= 400 .cse11) (= 400 .cse12) (= .cse13 400))))))))) (forall ((v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int)) (< (select (let ((.cse19 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse22 (let ((.cse23 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse20 (select .cse22 .cse1))) (or (= 400 .cse20) (< (select (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse20 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse1) 2147483647))))))) is different from false [2024-11-13 12:20:22,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse12 (select .cse8 .cse10))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (+ .cse12 1)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (= 400 .cse12))) (and (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse4 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse6 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse6))))))) (< .cse12 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_53| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse21 (let ((.cse22 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_53|)))) (let ((.cse17 (select .cse21 .cse2))) (let ((.cse19 (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse16 (select .cse19 .cse2))) (let ((.cse14 (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ 1 .cse16))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse15 (select .cse14 .cse2))) (or (< (select (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse15) (= 400 .cse16) (= 400 .cse17))))))))) (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse29 (let ((.cse30 (select (store .cse25 |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse27 (select .cse29 .cse2))) (let ((.cse26 (let ((.cse28 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse29 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse27 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse28 (+ |c_~#queue~0.offset| (* (select .cse28 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse23 (select .cse26 .cse2))) (or (= 400 .cse23) (< (select (let ((.cse24 (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse27))))))))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int)) (< (select (let ((.cse31 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647)) .cse0))))) is different from false [2024-11-13 12:20:22,804 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse12 (select .cse8 .cse10))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (+ .cse12 1)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (= 400 .cse12))) (and (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse4 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse6 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse6))))))) (< .cse12 2147483647) (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_49| Int) (v_ArrVal_1776 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_1780 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)))) (let ((.cse19 (let ((.cse20 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1776) |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)))) (let ((.cse17 (select .cse19 .cse2))) (let ((.cse16 (let ((.cse18 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse19 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_84| 1)) .cse2 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1780) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_49|)))) (let ((.cse13 (select .cse16 .cse2))) (or (= 400 .cse13) (< (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_81| 1)) .cse2 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647) (= 400 .cse17))))))))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1784 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int)) (< (select (let ((.cse21 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 .cse11)) |c_~#stored_elements~0.base| v_ArrVal_1784) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_47|)) .cse2) 2147483647)) .cse0))))) is different from false [2024-11-13 12:20:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 12:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-13 12:20:23,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 12:20:23,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 12:20:23,280 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-13 12:20:23,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:20:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1912293791, now seen corresponding path program 3 times [2024-11-13 12:20:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:20:23,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709356650] [2024-11-13 12:20:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:20:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:20:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:20:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:20:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:20:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709356650] [2024-11-13 12:20:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709356650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:20:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193293570] [2024-11-13 12:20:35,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:20:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:20:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:20:35,689 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:20:35,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_538be6c1-0ba0-491d-b961-322cc68b3b56/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process