./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_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_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/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_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/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_4b822e37-1e9d-44a8-b614-647af5b82150/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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:33:29,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:33:29,757 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-13 12:33:29,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:33:29,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:33:29,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:33:29,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:33:29,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:33:29,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:33:29,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:33:29,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:33:29,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:33:29,810 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:33:29,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:33:29,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:33:29,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:33:29,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:33:29,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:33:29,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:33:29,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:33:29,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:33:29,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:33:29,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:33:29,813 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:33:29,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:33:29,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:33:29,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 12:33:29,815 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 12:33:29,816 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 12:33:29,816 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_4b822e37-1e9d-44a8-b614-647af5b82150/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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-11-13 12:33:30,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:33:30,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:33:30,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:33:30,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:33:30,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:33:30,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/../../sv-benchmarks/c/pthread/queue_longer.i Unable to find full path for "g++" [2024-11-13 12:33:32,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:33:32,493 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:33:32,494 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/sv-benchmarks/c/pthread/queue_longer.i [2024-11-13 12:33:32,519 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/data/ba8660883/96b4dc9a34254dbd9f876bdbe405c0eb/FLAGe65e1d9db [2024-11-13 12:33:32,533 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/data/ba8660883/96b4dc9a34254dbd9f876bdbe405c0eb [2024-11-13 12:33:32,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:33:32,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:33:32,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:33:32,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:33:32,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:33:32,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:33:32" (1/1) ... [2024-11-13 12:33:32,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5915ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:32, skipping insertion in model container [2024-11-13 12:33:32,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:33:32" (1/1) ... [2024-11-13 12:33:32,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:33:33,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:33:33,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:33:33,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:33:33,357 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:33:33,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33 WrapperNode [2024-11-13 12:33:33,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:33:33,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:33:33,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:33:33,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:33:33,367 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:33:33" (1/1) ... [2024-11-13 12:33:33,413 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:33:33" (1/1) ... [2024-11-13 12:33:33,496 INFO L138 Inliner]: procedures = 277, calls = 862, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1065 [2024-11-13 12:33:33,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:33:33,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:33:33,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:33:33,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:33:33,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:33:33,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:33:33,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:33:33,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:33:33,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (1/1) ... [2024-11-13 12:33:33,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:33:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:33:33,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/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:33:33,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/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:33:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-13 12:33:33,702 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-13 12:33:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-13 12:33:33,702 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 12:33:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:33:33,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:33:33,706 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:33:33,903 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:33:33,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:33:35,743 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:33:35,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:33:43,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:33:43,896 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:33:43,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:33:43 BoogieIcfgContainer [2024-11-13 12:33:43,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:33:43,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:33:43,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:33:43,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:33:43,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:33:32" (1/3) ... [2024-11-13 12:33:43,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c65922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:33:43, skipping insertion in model container [2024-11-13 12:33:43,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:33:33" (2/3) ... [2024-11-13 12:33:43,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c65922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:33:43, skipping insertion in model container [2024-11-13 12:33:43,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:33:43" (3/3) ... [2024-11-13 12:33:43,907 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-13 12:33:43,924 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:33:43,926 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2024-11-13 12:33:43,926 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:33:44,030 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 12:33:44,084 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:33:44,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 12:33:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:33:44,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 12:33:44,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 12:33:44,134 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:33:44,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-13 12:33:44,159 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;@67616a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:33:44,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-13 12:33:44,765 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 71 treesize of output 47 [2024-11-13 12:33:44,799 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 71 treesize of output 47 [2024-11-13 12:33:44,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:44,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash -326712067, now seen corresponding path program 1 times [2024-11-13 12:33:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920598984] [2024-11-13 12:33:44,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:47,467 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:33:47,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920598984] [2024-11-13 12:33:47,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920598984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:47,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:33:47,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:33:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478708748] [2024-11-13 12:33:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:33:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:33:47,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:33:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:47,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:47,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:33:47,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:48,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:33:48,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:48,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1538137123, now seen corresponding path program 1 times [2024-11-13 12:33:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:48,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828459650] [2024-11-13 12:33:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:50,219 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:33:50,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:50,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828459650] [2024-11-13 12:33:50,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828459650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:50,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:33:50,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:33:50,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474078531] [2024-11-13 12:33:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:50,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:33:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:33:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:33:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:50,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:50,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:33:50,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:50,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:50,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:33:50,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:50,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash -680949760, now seen corresponding path program 1 times [2024-11-13 12:33:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743428500] [2024-11-13 12:33:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:52,285 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:33:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743428500] [2024-11-13 12:33:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743428500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:52,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:33:52,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:33:52,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008915233] [2024-11-13 12:33:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:52,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:33:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:33:52,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:33:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:52,289 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:52,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:33:52,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:52,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:52,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:54,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:33:54,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash -96274811, now seen corresponding path program 1 times [2024-11-13 12:33:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:54,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80944855] [2024-11-13 12:33:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:54,796 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:33:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80944855] [2024-11-13 12:33:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80944855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:54,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:33:54,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:33:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136114561] [2024-11-13 12:33:54,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:54,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:33:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:54,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:33:54,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:33:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:54,799 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:33:54,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:54,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:54,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:54,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:55,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:33:55,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:55,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1450552869, now seen corresponding path program 1 times [2024-11-13 12:33:55,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:55,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117732222] [2024-11-13 12:33:55,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:33:56,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117732222] [2024-11-13 12:33:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117732222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:33:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:33:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5402050] [2024-11-13 12:33:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:33:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:33:56,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:33:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:56,110 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:56,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:33:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:56,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:56,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:56,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:33:56,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:56,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash -217519631, now seen corresponding path program 1 times [2024-11-13 12:33:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:56,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576610017] [2024-11-13 12:33:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:33:57,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:57,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576610017] [2024-11-13 12:33:57,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576610017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:33:57,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411738784] [2024-11-13 12:33:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:57,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:33:57,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:33:57,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:33:57,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:33:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:57,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 1931 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:33:57,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:33:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:33:57,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:33:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411738784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:57,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:33:57,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-13 12:33:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577415451] [2024-11-13 12:33:57,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:57,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:33:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:33:57,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:33:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:57,811 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:57,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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:33:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:33:58,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 12:33:58,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:58,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1846828426, now seen corresponding path program 1 times [2024-11-13 12:33:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282885969] [2024-11-13 12:33:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:33:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282885969] [2024-11-13 12:33:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282885969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:58,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:33:58,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:33:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970789048] [2024-11-13 12:33:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:58,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:33:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:58,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:33:58,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:33:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:58,616 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:58,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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:33:58,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:58,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:58,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:33:59,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:33:59,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:33:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash -250047124, now seen corresponding path program 1 times [2024-11-13 12:33:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:33:59,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615831368] [2024-11-13 12:33:59,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:33:59,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:33:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:33:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 12:33:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:33:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615831368] [2024-11-13 12:33:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615831368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:33:59,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:33:59,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:33:59,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340182776] [2024-11-13 12:33:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:33:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:33:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:33:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:33:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:33:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:33:59,521 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:33:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:33:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:33:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:33:59,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:34:01,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1233069837, now seen corresponding path program 1 times [2024-11-13 12:34:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660365336] [2024-11-13 12:34:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:34:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:01,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660365336] [2024-11-13 12:34:01,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660365336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:01,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:34:01,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:34:01,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654372996] [2024-11-13 12:34:01,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:01,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:34:01,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:34:01,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:34:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:01,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:01,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:01,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:01,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:34:01,855 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:01,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1322803330, now seen corresponding path program 1 times [2024-11-13 12:34:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080851340] [2024-11-13 12:34:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:04,701 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:34:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080851340] [2024-11-13 12:34:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080851340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:34:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:34:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870055846] [2024-11-13 12:34:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:04,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:34:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:34:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:34:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:04,704 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:04,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:04,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:06,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:34:06,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:06,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1942767341, now seen corresponding path program 1 times [2024-11-13 12:34:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:06,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019872721] [2024-11-13 12:34:06,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:09,177 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:34:09,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:09,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019872721] [2024-11-13 12:34:09,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019872721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:09,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:34:09,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:34:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676571099] [2024-11-13 12:34:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:09,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:34:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:34:09,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:34:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:09,180 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:09,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:09,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:10,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:34:10,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:10,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1311435608, now seen corresponding path program 1 times [2024-11-13 12:34:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687947112] [2024-11-13 12:34:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:12,468 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:34:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687947112] [2024-11-13 12:34:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687947112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:34:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:34:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37798574] [2024-11-13 12:34:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:12,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:34:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:12,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:34:12,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:34:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:12,470 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:12,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 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:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:12,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:12,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:12,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:13,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:34:13,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:13,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1999800584, now seen corresponding path program 1 times [2024-11-13 12:34:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:13,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078814513] [2024-11-13 12:34:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:15,737 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:34:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078814513] [2024-11-13 12:34:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078814513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:15,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:34:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:34:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515289214] [2024-11-13 12:34:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:15,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:34:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:34:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:34:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:15,739 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:15,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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:34:15,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:15,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:15,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:15,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:15,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:15,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:17,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:34:17,698 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:17,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1763820066, now seen corresponding path program 1 times [2024-11-13 12:34:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672666605] [2024-11-13 12:34:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:34:18,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672666605] [2024-11-13 12:34:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672666605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:18,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:34:18,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:34:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069519140] [2024-11-13 12:34:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:18,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:34:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:18,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:34:18,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:34:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:18,819 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:18,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 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:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:20,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 12:34:20,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:20,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:20,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1156155191, now seen corresponding path program 1 times [2024-11-13 12:34:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483844076] [2024-11-13 12:34:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:26,566 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:34:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483844076] [2024-11-13 12:34:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483844076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:34:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220237898] [2024-11-13 12:34:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:26,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:34:26,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:34:26,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:34:26,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:34:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:27,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 2100 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-13 12:34:27,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:34:27,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 32 treesize of output 16 [2024-11-13 12:34:27,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:27,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 19 treesize of output 14 [2024-11-13 12:34:27,408 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:34:27,424 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-13 12:34:27,425 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 46 treesize of output 36 [2024-11-13 12:34:27,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:27,515 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 30 treesize of output 14 [2024-11-13 12:34:27,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:27,701 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 1 case distinctions, treesize of input 51 treesize of output 32 [2024-11-13 12:34:27,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:27,811 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 38 treesize of output 29 [2024-11-13 12:34:28,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:34:28,041 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 66 treesize of output 32 [2024-11-13 12:34:28,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:28,134 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 1 case distinctions, treesize of input 49 treesize of output 30 [2024-11-13 12:34:28,254 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 52 treesize of output 42 [2024-11-13 12:34:28,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:28,258 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 52 treesize of output 28 [2024-11-13 12:34:28,289 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:34:28,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:34:28,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 Int) (v_ArrVal_1047 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_1049 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1049 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1049) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1050) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483647)))) is different from false [2024-11-13 12:34:29,003 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 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1050 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_1049 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1045) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1049 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1049) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1050) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1045)))) (= 400 .cse4)))) is different from false [2024-11-13 12:34:29,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_1049 Int) (v_ArrVal_1042 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1042) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|)))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse4 .cse2))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1045) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1049 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1049) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1050) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483647) (= 400 .cse3) (< 2147483647 v_ArrVal_1045))))))) is different from false [2024-11-13 12:34:29,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:29,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 579 treesize of output 279 [2024-11-13 12:34:29,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:29,978 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 287 treesize of output 277 [2024-11-13 12:34:29,988 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 40 treesize of output 28 [2024-11-13 12:34:29,998 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 32 treesize of output 20 [2024-11-13 12:34:30,029 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 7 treesize of output 3 [2024-11-13 12:34:30,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:30,079 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 108 treesize of output 84 [2024-11-13 12:34:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 12:34:30,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220237898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:34:30,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:34:30,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 42 [2024-11-13 12:34:30,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652776597] [2024-11-13 12:34:30,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:34:30,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-13 12:34:30,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:30,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-13 12:34:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1399, Unknown=19, NotChecked=240, Total=1892 [2024-11-13 12:34:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:30,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:30,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.7906976744186047) internal successors, (163), 43 states have internal predecessors, (163), 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:34:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:30,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 12:34:36,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:34:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 12:34:37,164 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:37,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1331314564, now seen corresponding path program 1 times [2024-11-13 12:34:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997985864] [2024-11-13 12:34:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:40,862 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:34:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997985864] [2024-11-13 12:34:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997985864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:34:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855039394] [2024-11-13 12:34:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:40,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:34:40,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:34:40,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:34:40,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:34:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:41,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 12:34:41,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:34:41,588 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:34:41,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:41,643 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:34:41,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:41,777 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 31 treesize of output 15 [2024-11-13 12:34:41,816 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:34:41,892 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-13 12:34:41,892 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 66 treesize of output 56 [2024-11-13 12:34:41,938 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:34:41,947 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 21 treesize of output 9 [2024-11-13 12:34:41,975 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:34:41,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:34:42,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (v_ArrVal_1262 (Array Int Int))) (or (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1262) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|)) .cse1)))) (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_17| 2147483648) 0))) is different from false [2024-11-13 12:34:42,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:42,635 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 1 case distinctions, treesize of input 54 treesize of output 43 [2024-11-13 12:34:42,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:42,650 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:34:42,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:34:42,681 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:34:42,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:34:42,694 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 52 treesize of output 44 [2024-11-13 12:34:42,888 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:34:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855039394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:34:42,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:34:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 27 [2024-11-13 12:34:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95164568] [2024-11-13 12:34:42,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:34:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 12:34:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 12:34:42,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=641, Unknown=1, NotChecked=52, Total=812 [2024-11-13 12:34:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:42,891 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:42,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 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:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:42,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:34:42,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:42,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:42,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 12:34:42,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 12:34:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:34:48,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:34:48,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 12:34:48,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:48,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1528365038, now seen corresponding path program 1 times [2024-11-13 12:34:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:48,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288974043] [2024-11-13 12:34:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:34:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288974043] [2024-11-13 12:34:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288974043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:34:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600578274] [2024-11-13 12:34:48,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:48,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:34:48,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:34:48,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:34:48,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:34:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:49,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 2313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:34:49,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:34:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:34:49,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:34:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600578274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:49,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:34:49,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-13 12:34:49,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912126030] [2024-11-13 12:34:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:49,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:34:49,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:49,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:34:49,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:34:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:49,636 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:49,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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:34:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:49,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:34:49,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:34:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 12:34:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:34:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:34:50,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:34:50,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 12:34:50,823 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:50,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1979945567, now seen corresponding path program 1 times [2024-11-13 12:34:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:50,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957165604] [2024-11-13 12:34:50,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 12:34:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:51,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957165604] [2024-11-13 12:34:51,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957165604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:34:51,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:34:51,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:34:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810975355] [2024-11-13 12:34:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:34:51,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:34:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:34:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:34:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:34:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:51,102 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:34:51,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:51,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:51,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:34:51,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:51,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:51,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-13 12:34:51,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:34:51,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:34:51,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:34:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:34:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:34:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 12:34:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:34:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:34:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:34:52,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 12:34:52,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:34:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:34:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2118508224, now seen corresponding path program 1 times [2024-11-13 12:34:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:34:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672448029] [2024-11-13 12:34:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:34:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:34:57,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:34:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672448029] [2024-11-13 12:34:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672448029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:34:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128947467] [2024-11-13 12:34:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:34:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:34:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:34:57,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:34:57,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:34:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:34:57,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 2316 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-13 12:34:57,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:34:57,883 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 21 treesize of output 15 [2024-11-13 12:34:57,949 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:34:58,012 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:34:58,114 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:34:58,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:58,169 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:34:58,358 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-13 12:34:58,358 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:34:58,440 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:34:58,555 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:34:58,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:58,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 16 [2024-11-13 12:34:58,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:34:58,828 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:34:58,942 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:34:58,942 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:34:59,014 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:34:59,127 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:34:59,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:34:59,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 12:34:59,348 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:34:59,385 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:34:59,455 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:34:59,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-13 12:34:59,514 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:34:59,524 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:34:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:34:59,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:34:59,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2030 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 2147483647)) is different from false [2024-11-13 12:34:59,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2030 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 2147483647)) is different from false [2024-11-13 12:34:59,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2030 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (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_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|)))) is different from false [2024-11-13 12:34:59,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2028 Int) (v_ArrVal_2030 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2028) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|)))) is different from false [2024-11-13 12:35:01,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_2028 Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int 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 .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647)))))) is different from false [2024-11-13 12:35:01,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_2028 Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2019 Int) (v_ArrVal_2030 (Array Int 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 (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2019) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|)))))) is different from false [2024-11-13 12:35:01,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2016 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_2028 Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2019 Int) (v_ArrVal_2030 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2016) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (.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_ArrVal_2019) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|)))))) is different from false [2024-11-13 12:35:01,906 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2016 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_2028 Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2019 Int) (v_ArrVal_2030 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse2 (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2016) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse6 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_2019) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647)))))) is different from false [2024-11-13 12:35:01,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2016 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_2028 Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2019 Int) (v_ArrVal_2030 (Array Int 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)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))))) (let ((.cse5 (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2016) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_2019) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|))))))) is different from false [2024-11-13 12:35:02,017 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2016 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_2028 Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2019 Int) (v_ArrVal_2030 (Array Int 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)) (.cse4 (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_63| 1))))) (let ((.cse2 (let ((.cse9 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2016) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_2019) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|))))))) is different from false [2024-11-13 12:35:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-13 12:35:02,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128947467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:35:02,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:35:02,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 22] total 54 [2024-11-13 12:35:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659155237] [2024-11-13 12:35:02,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:35:02,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-13 12:35:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:35:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-13 12:35:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=1615, Unknown=24, NotChecked=970, Total=3080 [2024-11-13 12:35:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:35:02,557 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:35:02,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.763636363636364) internal successors, (262), 55 states have internal predecessors, (262), 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:35:02,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:02,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:02,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:02,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:35:07,685 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_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2030 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_2016 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2013 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| Int) (v_ArrVal_2028 Int) (v_ArrVal_2019 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| Int)) (let ((.cse3 (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2013))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_2016) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse2 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_2019) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60| 1))) |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_63|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_60|) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647)))))))) is different from false [2024-11-13 12:35:07,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2030 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_2028 Int) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2021) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2028) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|)))))) is different from false [2024-11-13 12:35:08,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse6 .cse7))) (and (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_2028 Int) (v_ArrVal_2030 (Array Int Int))) (let ((.cse3 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2028) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse2) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2028 Int) (v_ArrVal_2030 (Array Int Int))) (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|) v_ArrVal_2028) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse2) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|)))))) is different from false [2024-11-13 12:35:09,243 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)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2028 Int) (v_ArrVal_2030 (Array Int Int))) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2028) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse2) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (v_ArrVal_2022 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_2028 Int) (v_ArrVal_2030 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_2022) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) v_ArrVal_2025)))) (let ((.cse5 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2028) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse2) 2147483647)))))))) is different from false [2024-11-13 12:35:10,452 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))) (and (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2028 Int) (v_ArrVal_2030 (Array Int Int))) (or (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2028) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse2)) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|)))))) is different from false [2024-11-13 12:35:10,458 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 (select .cse2 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2030 (Array Int Int))) (or (< (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_57| 1))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_57|))) (< .cse4 2147483647)))) is different from false [2024-11-13 12:35:10,463 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_2030 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2030) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 2147483647))) is different from false [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:35:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-13 12:35:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:35:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:35:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:35:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:35:11,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 12:35:11,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:35:11,670 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:35:11,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:35:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1426078676, now seen corresponding path program 2 times [2024-11-13 12:35:11,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:35:11,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724653959] [2024-11-13 12:35:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:35:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:35:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:35:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:35:24,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:35:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724653959] [2024-11-13 12:35:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724653959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:35:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245814377] [2024-11-13 12:35:24,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:35:24,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:35:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:35:24,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:35:24,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:35:27,746 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:35:27,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:35:27,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 200 conjuncts are in the unsatisfiable core [2024-11-13 12:35:27,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:35:27,794 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 21 treesize of output 15 [2024-11-13 12:35:27,886 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:35:27,957 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:35:28,067 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:35:28,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:35:28,132 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:35:28,291 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-13 12:35:28,292 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:35:28,393 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:35:28,551 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:35:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:35:28,635 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:35:28,820 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:35:28,876 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:35:29,017 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:35:29,017 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:35:29,087 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:35:29,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-13 12:35:29,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:35:29,308 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:35:29,484 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:35:29,540 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:35:29,677 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:35:29,677 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:35:29,749 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:35:29,929 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:35:30,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:35:30,013 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:35:30,168 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:35:30,205 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:35:30,318 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:35:30,318 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:35:30,402 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:35:30,493 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:35:30,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:35:30,555 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:35:30,691 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:35:30,732 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:35:30,823 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:35:30,823 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:35:30,891 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:35:31,026 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:35:31,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:35:31,089 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:35:31,238 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:35:31,269 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:35:31,339 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-13 12:35:31,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-13 12:35:31,386 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:35:31,397 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:35:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:35:31,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:35:31,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| 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_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1)) 2147483647)) is different from false [2024-11-13 12:35:31,983 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| 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_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1)) 2147483647))) is different from false [2024-11-13 12:35:31,997 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 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2643) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2024-11-13 12:35:33,027 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (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|) v_ArrVal_2643) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= 400 .cse3)))))) is different from false [2024-11-13 12:35:33,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| 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 ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2643) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= .cse4 400)))))) is different from false [2024-11-13 12:35:33,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| 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)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2643) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= .cse4 400))))))) is different from false [2024-11-13 12:35:33,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| 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)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2634) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2643) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse4))))))) is different from false [2024-11-13 12:35:35,246 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2643) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))))))) is different from false [2024-11-13 12:35:35,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| 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 ((.cse6 (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5))))))) is different from false [2024-11-13 12:35:35,392 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse1 (let ((.cse8 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse0 (select .cse5 .cse2))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2643) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-13 12:35:35,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (select .cse9 .cse10))) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int)) (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|) v_ArrVal_2624) .cse10 (+ .cse11 1))))) (let ((.cse1 (let ((.cse8 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse0 (select .cse5 .cse2))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2643) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647))))))) (= 400 .cse11)))) is different from false [2024-11-13 12:35:42,167 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))))) (let ((.cse12 (let ((.cse13 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse12 .cse3))) (let ((.cse2 (let ((.cse11 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2624) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse8 (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse8 .cse3))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse4) (= .cse5 400) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)))))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-13 12:35:42,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse13 .cse14))) (or (= 400 .cse0) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2616) .cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))))) (let ((.cse11 (let ((.cse12 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse11 .cse2))) (let ((.cse1 (let ((.cse10 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2624) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse5 (let ((.cse9 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse7 (select .cse5 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2643) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647) (= 400 .cse7) (= 400 .cse8)))))))))))) is different from false [2024-11-13 12:35:50,545 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |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_87| 1))))) (let ((.cse11 (let ((.cse16 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (.cse9 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse14 (let ((.cse15 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_2616) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse10 (select .cse14 .cse2))) (let ((.cse1 (let ((.cse13 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse14 .cse9 v_ArrVal_2624) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse8 (let ((.cse12 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse9 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse11 .cse2)) (.cse0 (select .cse8 .cse2))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|) (= 400 .cse5) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647) (= .cse10 400))))))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-13 12:35:50,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse16 .cse17))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2606 Int) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2606) .cse17 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| 1))))) (let ((.cse10 (let ((.cse15 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse13 (let ((.cse14 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2616) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select .cse13 .cse4))) (let ((.cse9 (let ((.cse12 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_2624) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2634) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse1 (select .cse10 .cse4)) (.cse8 (select .cse6 .cse4))) (or (= 400 .cse0) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse4 (+ 1 .cse8))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse1) (= 400 .cse8)))))))))) (= 400 .cse2)))) is different from false [2024-11-13 12:35:55,530 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2606 Int) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (let ((.cse16 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2604) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse9 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2606) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| 1))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse13 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2616) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse4 (select .cse13 .cse3))) (let ((.cse2 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_2624) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse1 (select .cse10 .cse3)) (.cse0 (select .cse9 .cse3)) (.cse8 (select .cse6 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse4) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (= 400 .cse8))))))))))) is different from false [2024-11-13 12:35:55,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2606 Int) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (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 ((.cse17 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2604) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse10 (let ((.cse16 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_2606) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| 1))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse4))) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse14 (let ((.cse15 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2616) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse8 (select .cse14 .cse4))) (let ((.cse9 (let ((.cse13 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_2624) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse12 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2634) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse0 (select .cse11 .cse4)) (.cse1 (select .cse6 .cse4)) (.cse2 (select .cse10 .cse4))) (or (= .cse0 400) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|) (= 400 .cse1) (= .cse2 400) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse4))) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse4) 2147483647) (= 400 .cse8) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|))))))))))) is different from false [2024-11-13 12:35:55,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2606 Int) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90| 1))))) (let ((.cse13 (let ((.cse19 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2604) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|))) (.cse9 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse18 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_2606) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| 1))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* 4 (select .cse18 .cse5))) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse16 (let ((.cse17 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2616) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse11 (select .cse16 .cse5))) (let ((.cse4 (let ((.cse15 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_2624) .cse5 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse8 (let ((.cse14 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_2634) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse2 (select .cse13 .cse5)) (.cse3 (select .cse12 .cse5)) (.cse10 (select .cse8 .cse5))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|) (= 400 .cse3) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse5 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse5) 2147483647) (= 400 .cse2) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (= .cse10 400) (= .cse11 400)))))))))))) is different from false [2024-11-13 12:35:56,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2606 Int) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90| 1))))) (let ((.cse13 (let ((.cse19 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2604) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* 4 (select .cse19 .cse5))) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|))) (.cse9 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse18 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_2606) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| 1))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse16 (let ((.cse17 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2616) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse11 (select .cse16 .cse5))) (let ((.cse4 (let ((.cse15 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_2624) .cse5 (+ 1 .cse11))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse8 (let ((.cse14 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_2634) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse0 (select .cse13 .cse5)) (.cse3 (select .cse12 .cse5)) (.cse10 (select .cse8 .cse5))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (= 400 .cse0) (= 400 .cse3) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse5 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse5) 2147483647) (= 400 .cse11) (= 400 .cse10)))))))))))) is different from false [2024-11-13 12:36:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 250 refuted. 5 times theorem prover too weak. 0 trivial. 90 not checked. [2024-11-13 12:36:02,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245814377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:36:02,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:36:02,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 43] total 102 [2024-11-13 12:36:02,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460739147] [2024-11-13 12:36:02,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:36:02,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-11-13 12:36:02,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-11-13 12:36:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1532, Invalid=5613, Unknown=71, NotChecked=3496, Total=10712 [2024-11-13 12:36:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:02,297 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:02,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 103 states have (on average 5.165048543689321) internal successors, (532), 103 states have internal predecessors, (532), 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:36:02,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:02,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:02,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:36:02,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:02,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:02,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:36:02,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:13,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse0 (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse4 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2643) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)))))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse9 (let ((.cse11 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse10 (select .cse9 .cse1))) (or (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2643) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= 400 .cse10))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2604 (Array Int Int)) (v_ArrVal_2606 Int) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_41| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2600 Int) (v_ArrVal_2609 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse19 (let ((.cse28 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2600)))) (let ((.cse21 (let ((.cse27 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90| 1))) |c_~#stored_elements~0.base| v_ArrVal_2604) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_41|)))) (let ((.cse20 (let ((.cse26 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse5 v_ArrVal_2606) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87| 1))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse24 (let ((.cse25 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse5 v_ArrVal_2616) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse12 (select .cse24 .cse1))) (let ((.cse18 (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse24 .cse5 v_ArrVal_2624) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse14 (let ((.cse22 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse18 .cse5 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse16 (select .cse21 .cse1)) (.cse17 (select .cse20 .cse1)) (.cse15 (select .cse14 .cse1))) (or (= 400 .cse12) (< (select (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_2643) .cse1 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse16 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_87|) (= 400 .cse17) (= 400 .cse16) (< (select .cse18 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_90|) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (= 400 .cse15))))))))))))) is different from false [2024-11-13 12:36:13,941 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse8 (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_2616) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select .cse11 .cse3))) (let ((.cse2 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_2624) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse1 (select .cse6 .cse3)) (.cse4 (select .cse8 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|))))))))) (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse14 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse22 (let ((.cse23 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse19 (select .cse22 .cse3))) (let ((.cse18 (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse7 v_ArrVal_2624) .cse3 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse16 (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse18 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse17 (select .cse16 .cse3))) (or (< (select (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse7 v_ArrVal_2643) .cse3 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse18 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse17) (= 400 .cse19)))))))) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse24 (let ((.cse29 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse27 (let ((.cse28 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse24 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse25 (select .cse27 .cse3))) (or (< (select .cse24 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse25) (< (select (let ((.cse26 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse27 .cse7 v_ArrVal_2643) .cse3 (+ .cse25 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse26 (+ (* 4 (select .cse26 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)))))) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse31 (let ((.cse33 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse32 (select .cse31 .cse3))) (or (< (select (let ((.cse30 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse31 .cse7 v_ArrVal_2643) .cse3 (+ .cse32 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (= 400 .cse32))))))) is different from false [2024-11-13 12:36:14,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse29 (+ (* (select .cse28 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse8 (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_2616) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select .cse11 .cse3))) (let ((.cse2 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_2624) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse1 (select .cse6 .cse3)) (.cse4 (select .cse8 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|))))))))) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse21 (let ((.cse22 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse18 (select .cse21 .cse3))) (let ((.cse17 (let ((.cse20 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse7 v_ArrVal_2624) .cse3 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse15 (let ((.cse19 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse17 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse16 (select .cse15 .cse3))) (or (< (select (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse7 v_ArrVal_2643) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse17 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse16) (= 400 .cse18)))))))) (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse23 (store .cse28 .cse29 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (let ((.cse26 (let ((.cse27 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse23 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse24 (select .cse26 .cse3))) (or (< (select .cse23 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse24) (< (select (let ((.cse25 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse26 .cse7 v_ArrVal_2643) .cse3 (+ .cse24 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse36 (store .cse28 .cse29 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (let ((.cse39 (let ((.cse40 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse36 .cse7 v_ArrVal_2616) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse40 (+ (* (select .cse40 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse31 (select .cse39 .cse3))) (let ((.cse30 (let ((.cse38 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse39 .cse7 v_ArrVal_2624) .cse3 (+ .cse31 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse35 (let ((.cse37 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse30 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse37 (+ (* (select .cse37 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse33 (select .cse35 .cse3)) (.cse32 (select .cse36 .cse3))) (or (< (select .cse30 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse31) (< .cse32 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (= 400 .cse33) (< (select (let ((.cse34 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse35 .cse7 v_ArrVal_2643) .cse3 (+ .cse33 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* (select .cse34 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (= 400 .cse32)))))))))))) is different from false [2024-11-13 12:36:19,559 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 ((.cse6 (select .cse8 .cse10))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse24 (+ .cse6 1)) (.cse11 (= 400 .cse6))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2634) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5)))))) (or .cse11 (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2616) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))))) (let ((.cse20 (let ((.cse21 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse17 (select .cse20 .cse1))) (let ((.cse12 (let ((.cse19 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_2624) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse15 (let ((.cse18 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse16 (select .cse15 .cse1))) (or (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2643) .cse1 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= 400 .cse16) (= 400 .cse17)))))))))) (< .cse6 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse22 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse23 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse10 .cse24)) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) .cse11) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int)) (let ((.cse28 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2624) .cse10 .cse24)))) (let ((.cse26 (let ((.cse31 (select (store .cse28 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse29 (let ((.cse30 (select (store (store .cse28 |c_~#queue~0.base| (store (store .cse26 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse25 (select .cse29 .cse1))) (or (= 400 .cse25) (< (select .cse26 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse27 (select (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse4 v_ArrVal_2643) .cse1 (+ .cse25 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse27 (+ (* 4 (select .cse27 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))))))) .cse11))))) is different from false [2024-11-13 12:36:28,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:36:31,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse57 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse18 (select .cse20 .cse22))) (let ((.cse21 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse44 (+ .cse18 1)) (.cse23 (= 400 .cse18)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse58 (+ (* (select .cse57 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse8 (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)))) (let ((.cse11 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_2616) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse0 (select .cse11 .cse3))) (let ((.cse2 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_2624) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse1 (select .cse6 .cse3)) (.cse4 (select .cse8 .cse3))) (or (= 400 .cse0) (= 400 .cse1) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|))))))))) (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse21 v_ArrVal_2634) .cse22 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse16 (let ((.cse19 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse17 (select .cse16 .cse3))) (or (< (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse7 v_ArrVal_2643) .cse3 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse17)))))) (or .cse23 (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse21 v_ArrVal_2616) .cse22 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))))) (let ((.cse32 (let ((.cse33 (select (store .cse26 |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse33 (+ |c_~#queue~0.offset| (* (select .cse33 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse29 (select .cse32 .cse3))) (let ((.cse24 (let ((.cse31 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse32 .cse7 v_ArrVal_2624) .cse3 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse27 (let ((.cse30 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse24 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse28 (select .cse27 .cse3))) (or (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select .cse24 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse25 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse7 v_ArrVal_2643) .cse3 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse25 (+ (* 4 (select .cse25 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (= 400 .cse28) (= 400 .cse29)))))))))) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse41 (let ((.cse42 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse42 (+ (* (select .cse42 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse38 (select .cse41 .cse3))) (let ((.cse37 (let ((.cse40 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse41 .cse7 v_ArrVal_2624) .cse3 (+ .cse38 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse40 (+ (* (select .cse40 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse35 (let ((.cse39 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse37 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse39 (+ (* (select .cse39 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse36 (select .cse35 .cse3))) (or (< (select (let ((.cse34 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse35 .cse7 v_ArrVal_2643) .cse3 (+ .cse36 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse34 (+ |c_~#queue~0.offset| (* (select .cse34 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (< (select .cse37 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse36) (= 400 .cse38)))))))) (< .cse18 2147483647) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse43 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse21 v_ArrVal_2643) .cse22 .cse44)) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse43 (+ (* (select .cse43 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)) .cse23) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int)) (let ((.cse48 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse21 v_ArrVal_2624) .cse22 .cse44)))) (let ((.cse46 (let ((.cse51 (select (store .cse48 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse51 (+ (* (select .cse51 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse49 (let ((.cse50 (select (store (store .cse48 |c_~#queue~0.base| (store (store .cse46 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse50 (+ |c_~#queue~0.offset| (* (select .cse50 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse45 (select .cse49 .cse3))) (or (= 400 .cse45) (< (select .cse46 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse47 (select (store (store .cse48 |c_~#queue~0.base| (store (store .cse49 .cse7 v_ArrVal_2643) .cse3 (+ .cse45 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse47 (+ (* 4 (select .cse47 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647))))))) .cse23) (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse52 (store .cse57 .cse58 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|))) (let ((.cse55 (let ((.cse56 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse52 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse56 (+ |c_~#queue~0.offset| (* (select .cse56 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse53 (select .cse55 .cse3))) (or (< (select .cse52 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse53) (< (select (let ((.cse54 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse55 .cse7 v_ArrVal_2643) .cse3 (+ .cse53 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse54 (+ (* (select .cse54 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse65 (store .cse57 .cse58 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|))) (let ((.cse68 (let ((.cse69 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse65 .cse7 v_ArrVal_2616) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))) |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse69 (+ (* (select .cse69 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse60 (select .cse68 .cse3))) (let ((.cse59 (let ((.cse67 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse68 .cse7 v_ArrVal_2624) .cse3 (+ .cse60 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse67 (+ (* (select .cse67 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse64 (let ((.cse66 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse59 .cse7 v_ArrVal_2634) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse66 (+ (* (select .cse66 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse62 (select .cse64 .cse3)) (.cse61 (select .cse65 .cse3))) (or (< (select .cse59 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse60) (< .cse61 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (= 400 .cse62) (< (select (let ((.cse63 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse64 .cse7 v_ArrVal_2643) .cse3 (+ .cse62 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse63 (+ |c_~#queue~0.offset| (* (select .cse63 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3) 2147483647) (= 400 .cse61))))))))))))) is different from false [2024-11-13 12:36:31,413 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 ((.cse6 (select .cse8 .cse10))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse23 (+ .cse6 1)) (.cse11 (= 400 .cse6))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2634) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5)))))) (or .cse11 (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2616 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2616) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))))) (let ((.cse20 (let ((.cse21 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse17 (select .cse20 .cse1))) (let ((.cse12 (let ((.cse19 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_2624) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse15 (let ((.cse18 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse16 (select .cse15 .cse1))) (or (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2643) .cse1 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= 400 .cse16) (= 400 .cse17)))))))))) (< .cse6 2147483647) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse22 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse10 .cse23)) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) .cse11) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int)) (let ((.cse27 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2624) .cse10 .cse23)))) (let ((.cse25 (let ((.cse30 (select (store .cse27 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse28 (let ((.cse29 (select (store (store .cse27 |c_~#queue~0.base| (store (store .cse25 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse24 (select .cse28 .cse1))) (or (= 400 .cse24) (< (select .cse25 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse26 (select (store (store .cse27 |c_~#queue~0.base| (store (store .cse28 .cse4 v_ArrVal_2643) .cse1 (+ .cse24 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse26 (+ (* 4 (select .cse26 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))))))) .cse11))))) is different from false [2024-11-13 12:36:31,444 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 ((.cse9 (select .cse11 .cse12))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse9 1)))) (.cse0 (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|))) (and (or .cse0 (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647))) (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse6 (let ((.cse10 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse8 (select .cse6 .cse2))) (or (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= .cse8 400)))))) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84| 1))))) (let ((.cse21 (let ((.cse22 (select (store .cse17 |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse14 (select .cse21 .cse2))) (let ((.cse13 (let ((.cse20 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse21 .cse7 v_ArrVal_2624) .cse2 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse18 (let ((.cse19 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse15 (select .cse18 .cse2))) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_84|) (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse14) (= .cse15 400) (< (select (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse7 v_ArrVal_2643) .cse2 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647))))))))) .cse0) (< .cse9 2147483647) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse24 (let ((.cse28 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse26 (let ((.cse27 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse24 .cse7 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse23 (select .cse26 .cse2))) (or (= 400 .cse23) (< (select .cse24 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse25 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse26 .cse7 v_ArrVal_2643) .cse2 (+ 1 .cse23))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647)))))) .cse0))))) is different from false [2024-11-13 12:36:32,198 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse5 (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 ((.cse10 (let ((.cse11 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse10 .cse2))) (let ((.cse1 (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2624) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse6 (let ((.cse8 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse7 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse3 (select .cse6 .cse2))) (or (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse3) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647)))))))))) is different from false [2024-11-13 12:36:32,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int) (v_ArrVal_2618 (Array Int Int))) (let ((.cse10 (let ((.cse11 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2618) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_37|)))) (let ((.cse7 (select .cse10 .cse1))) (let ((.cse6 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2624) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse3 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5) (= 400 .cse7)))))))) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse12 (let ((.cse17 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse15 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse13 (select .cse15 .cse1))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse13) (< (select (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2643) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)))))) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse19 (let ((.cse21 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse20 (select .cse19 .cse1))) (or (< (select (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_2643) .cse1 (+ .cse20 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= 400 .cse20))))))) is different from false [2024-11-13 12:36:39,597 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 ((.cse6 (select .cse8 .cse10))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ .cse6 1)) (.cse14 (= 400 .cse6))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2634) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5)))))) (< .cse6 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse12 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse10 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) .cse14) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int)) (let ((.cse18 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2624) .cse10 .cse13)))) (let ((.cse16 (let ((.cse21 (select (store .cse18 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse19 (let ((.cse20 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse15 (select .cse19 .cse1))) (or (= 400 .cse15) (< (select .cse16 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse17 (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_2643) .cse1 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))))))) .cse14))))) is different from false [2024-11-13 12:36:41,370 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 ((.cse6 (select .cse8 .cse10))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (+ .cse6 1)) (.cse13 (= 400 .cse6))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2634) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5)))))) (< .cse6 2147483647) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse10 .cse12)) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) .cse13) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (v_ArrVal_2624 Int)) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2624) .cse10 .cse12)))) (let ((.cse15 (let ((.cse20 (select (store .cse17 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse18 (let ((.cse19 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse14 (select .cse18 .cse1))) (or (= 400 .cse14) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse16 (select (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse4 v_ArrVal_2643) .cse1 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse16 (+ (* 4 (select .cse16 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))))))) .cse13))))) is different from false [2024-11-13 12:36:51,539 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 ((.cse9 (select .cse11 .cse12))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse9 1)))) (.cse0 (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|))) (and (or .cse0 (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647))) (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse6 (let ((.cse10 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse8 (select .cse6 .cse2))) (or (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2643) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= .cse8 400)))))) (< .cse9 2147483647) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse14 (let ((.cse18 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse16 (let ((.cse17 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_2634) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse13 (select .cse16 .cse2))) (or (= 400 .cse13) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (< (select (let ((.cse15 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse16 .cse7 v_ArrVal_2643) .cse2 (+ 1 .cse13))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse2) 2147483647)))))) .cse0))))) is different from false [2024-11-13 12:36:51,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.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|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse6 (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse3 (let ((.cse7 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5)))))) (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse10 (let ((.cse12 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse11 (select .cse10 .cse1))) (or (< (select (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2643) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= .cse11 400))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse13 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)))) is different from false [2024-11-13 12:36:53,405 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 ((.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (select .cse8 .cse10)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2634) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5)))))) (< .cse6 2147483647) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse10 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) (= 400 .cse6)) (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse12 (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse15 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse13 (select .cse15 .cse1))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse13) (< (select (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2643) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))))))))) is different from false [2024-11-13 12:36:55,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:36:55,891 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 ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (select .cse8 .cse10))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2634) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2643) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse5)))))) (forall ((v_ArrVal_2628 Int) (v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2630 Int) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_2628) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) v_ArrVal_2630)))) (let ((.cse11 (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)))) (let ((.cse15 (let ((.cse16 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_2634) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse12 (select .cse15 .cse1))) (or (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse12) (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2643) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))))))) (< .cse6 2147483647) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse18 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2643) .cse10 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) (= 400 .cse6))))) is different from false [2024-11-13 12:36:58,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select .cse7 .cse9))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_2634 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_2634) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2643) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= 400 .cse4)))))) (< .cse5 2147483647) (or (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_2643) .cse9 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)) (= 400 .cse5))))) is different from false [2024-11-13 12:36:58,186 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 ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse2 .cse3))) (and (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647))) (forall ((v_ArrVal_2636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse8 (select .cse7 .cse1))) (or (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2643) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_78|) (= .cse8 400)))))) (< .cse4 2147483647)))) is different from false [2024-11-13 12:36:58,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.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|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2643 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int)) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2636) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2643) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647) (= .cse4 400))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (select (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1) 2147483647)))) is different from false [2024-11-13 12:37:01,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:37:03,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2645) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3)) 2147483647)))) is different from false [2024-11-13 12:37:03,282 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_2645 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| 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_2645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1)) 2147483647))) is different from false [2024-11-13 12:37:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:37:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-13 12:37:04,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:37:04,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:04,420 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:04,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1287552260, now seen corresponding path program 3 times [2024-11-13 12:37:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:04,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341409499] [2024-11-13 12:37:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:04,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1749 backedges. 0 proven. 1749 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341409499] [2024-11-13 12:37:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341409499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170817850] [2024-11-13 12:37:55,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:37:55,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:55,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:37:55,027 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:55,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b822e37-1e9d-44a8-b614-647af5b82150/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process